/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:41:32,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:41:32,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:41:32,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:41:32,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:41:32,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:41:32,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:41:32,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:41:32,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:41:32,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:41:32,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:41:32,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:41:32,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:41:32,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:41:32,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:41:32,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:41:32,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:41:32,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:41:32,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:41:32,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:41:32,610 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:41:32,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:41:32,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:41:32,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:41:32,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:41:32,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:41:32,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:41:32,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:41:32,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:41:32,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:41:32,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:41:32,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:41:32,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:41:32,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:41:32,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:41:32,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:41:32,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:41:32,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:41:32,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:41:32,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:41:32,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:41:32,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:41:32,628 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:41:32,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:41:32,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:41:32,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:41:32,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:41:32,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:41:32,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:41:32,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:41:32,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:41:32,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:41:32,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:41:32,638 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:41:32,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:32,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:41:32,639 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:41:32,640 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 09:41:32,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:41:32,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:41:32,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:41:32,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:41:32,836 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:41:32,836 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 09:41:32,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec86d1ede/07949e69b92a419b857b1b618e6c2974/FLAG96882f019 [2022-04-28 09:41:33,227 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:41:33,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-28 09:41:33,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec86d1ede/07949e69b92a419b857b1b618e6c2974/FLAG96882f019 [2022-04-28 09:41:33,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec86d1ede/07949e69b92a419b857b1b618e6c2974 [2022-04-28 09:41:33,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:41:33,241 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:41:33,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:33,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:41:33,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:41:33,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed9bd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33, skipping insertion in model container [2022-04-28 09:41:33,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:41:33,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:41:33,409 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 09:41:33,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:33,439 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:41:33,449 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 09:41:33,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:33,465 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:41:33,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33 WrapperNode [2022-04-28 09:41:33,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:33,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:41:33,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:41:33,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:41:33,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:41:33,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:41:33,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:41:33,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:41:33,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (1/1) ... [2022-04-28 09:41:33,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:33,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:33,518 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 09:41:33,540 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 09:41:33,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:41:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:41:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:41:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:41:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:41:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:41:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 09:41:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:41:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:41:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:41:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:41:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:41:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:41:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:41:33,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:41:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:41:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:41:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 09:41:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:41:33,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:41:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:41:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:41:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:41:33,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:41:33,627 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:41:33,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:41:33,819 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:41:33,823 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:41:33,823 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 09:41:33,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:33 BoogieIcfgContainer [2022-04-28 09:41:33,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:41:33,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:41:33,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:41:33,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:41:33,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:41:33" (1/3) ... [2022-04-28 09:41:33,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:33, skipping insertion in model container [2022-04-28 09:41:33,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:33" (2/3) ... [2022-04-28 09:41:33,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451b675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:33, skipping insertion in model container [2022-04-28 09:41:33,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:33" (3/3) ... [2022-04-28 09:41:33,830 INFO L111 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2022-04-28 09:41:33,839 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:41:33,839 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:41:33,876 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:41:33,883 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@6a47fa4c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d719dba [2022-04-28 09:41:33,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:41:33,892 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 09:41:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:41:33,897 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:33,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:33,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 1 times [2022-04-28 09:41:33,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:33,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2009604556] [2022-04-28 09:41:33,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:41:33,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 2 times [2022-04-28 09:41:33,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:33,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511807312] [2022-04-28 09:41:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:34,126 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 09:41:34,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 09:41:34,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-28 09:41:34,128 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 09:41:34,128 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 09:41:34,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 09:41:34,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-28 09:41:34,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-28 09:41:34,129 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 09:41:34,129 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 09:41:34,130 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 09:41:34,130 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 09:41:34,131 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 09:41:34,131 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 09:41:34,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-28 09:41:34,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-28 09:41:34,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 09:41:34,132 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 09:41:34,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:34,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511807312] [2022-04-28 09:41:34,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511807312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:34,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:34,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:41:34,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:34,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2009604556] [2022-04-28 09:41:34,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2009604556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:34,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:34,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:41:34,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295161123] [2022-04-28 09:41:34,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:34,140 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 09:41:34,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:34,143 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 09:41:34,155 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 09:41:34,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:41:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:41:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:41:34,171 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 09:41:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,424 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-28 09:41:34,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:41:34,424 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 09:41:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:34,425 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 09:41:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-28 09:41:34,437 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 09:41:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-28 09:41:34,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-28 09:41:34,499 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 09:41:34,505 INFO L225 Difference]: With dead ends: 48 [2022-04-28 09:41:34,506 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:41:34,509 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 09:41:34,513 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 09:41:34,516 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 09:41:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:41:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 09:41:34,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:34,541 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 09:41:34,542 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 09:41:34,542 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 09:41:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,546 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 09:41:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:41:34,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:34,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:34,547 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 09:41:34,547 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 09:41:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:34,549 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-28 09:41:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-28 09:41:34,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:34,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:34,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:34,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:34,551 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 09:41:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 09:41:34,555 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-28 09:41:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:34,558 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 09:41:34,562 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 09:41:34,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 09:41:34,582 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 09:41:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 09:41:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:41:34,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:34,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:34,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:41:34,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:34,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:34,585 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 1 times [2022-04-28 09:41:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:34,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [153944863] [2022-04-28 09:41:34,595 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:34,595 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 2 times [2022-04-28 09:41:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:34,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430196410] [2022-04-28 09:41:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:34,846 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 09:41:34,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 09:41:34,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-28 09:41:34,847 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 09:41:34,848 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 09:41:34,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 09:41:34,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-28 09:41:34,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-28 09:41:34,848 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 09:41:34,849 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 09:41:34,850 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 09:41:34,850 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 09:41:34,851 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 09:41:34,851 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 09:41:34,852 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 09:41:34,852 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 09:41:34,853 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 09:41:34,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {228#false} is VALID [2022-04-28 09:41:34,853 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-28 09:41:34,854 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 09:41:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430196410] [2022-04-28 09:41:34,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430196410] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900541995] [2022-04-28 09:41:34,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:41:34,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:34,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:34,859 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 09:41:34,860 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 09:41:34,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:41:34,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:34,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:41:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:34,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:34,998 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 09:41:35,079 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 09:41:35,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-28 09:41:35,131 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 09:41:35,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 09:41:35,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-28 09:41:35,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-28 09:41:35,133 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 09:41:35,133 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 09:41:35,134 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 09:41:35,135 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 09:41:35,135 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 09:41:35,136 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 09:41:35,137 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 09:41:35,142 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 09:41:35,143 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 09:41:35,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-28 09:41:35,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-28 09:41:35,145 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 09:41:35,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:35,319 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 09:41:35,336 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 09:41:35,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-28 09:41:35,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-28 09:41:35,386 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 09:41:35,387 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 09:41:35,390 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 09:41:35,390 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 09:41:35,391 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 09:41:35,391 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 09:41:35,392 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 09:41:35,393 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 09:41:35,393 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 09:41:35,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-28 09:41:35,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-28 09:41:35,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-28 09:41:35,393 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 09:41:35,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-28 09:41:35,394 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 09:41:35,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900541995] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:35,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:35,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2022-04-28 09:41:35,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:35,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [153944863] [2022-04-28 09:41:35,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [153944863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:35,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:35,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:41:35,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599881493] [2022-04-28 09:41:35,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:35,397 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 09:41:35,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:35,398 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 09:41:35,410 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 09:41:35,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:41:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:41:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:41:35,412 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 09:41:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:35,771 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 09:41:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 09:41:35,772 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 09:41:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:35,772 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 09:41:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 09:41:35,774 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 09:41:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 09:41:35,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-28 09:41:35,801 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 09:41:35,803 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:41:35,804 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:41:35,804 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 09:41:35,807 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 09:41:35,809 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 09:41:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:41:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-28 09:41:35,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:35,817 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 09:41:35,818 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 09:41:35,819 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 09:41:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:35,821 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:41:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:41:35,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:35,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:35,822 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 09:41:35,822 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 09:41:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:35,825 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:41:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:41:35,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:35,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:35,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:35,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:35,826 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 09:41:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-28 09:41:35,834 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2022-04-28 09:41:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:35,834 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-28 09:41:35,835 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 09:41:35,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-28 09:41:35,858 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 09:41:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-28 09:41:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 09:41:35,859 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:35,859 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 09:41:35,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:41:36,076 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 09:41:36,077 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:36,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 1 times [2022-04-28 09:41:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:36,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1877509369] [2022-04-28 09:41:36,081 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:36,081 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 2 times [2022-04-28 09:41:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:36,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935139018] [2022-04-28 09:41:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:36,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:36,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:36,177 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 09:41:36,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 09:41:36,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-28 09:41:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 09:41:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:36,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-28 09:41:36,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-28 09:41:36,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 09:41:36,184 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 09:41:36,184 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 09:41:36,185 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 09:41:36,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 09:41:36,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-28 09:41:36,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-28 09:41:36,185 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 09:41:36,186 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 09:41:36,186 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 09:41:36,186 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 09:41:36,187 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 09:41:36,187 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 09:41:36,188 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 09:41:36,188 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 09:41:36,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-28 09:41:36,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-28 09:41:36,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 09:41:36,189 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 09:41:36,189 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 09:41:36,190 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 09:41:36,190 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 09:41:36,190 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 09:41:36,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-28 09:41:36,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-28 09:41:36,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 09:41:36,191 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 09:41:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:36,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935139018] [2022-04-28 09:41:36,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935139018] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:36,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750885036] [2022-04-28 09:41:36,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:41:36,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:36,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:36,193 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 09:41:36,212 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 09:41:36,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:41:36,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:36,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:41:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:36,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:36,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-28 09:41:36,436 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 09:41:36,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 09:41:36,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-28 09:41:36,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-28 09:41:36,436 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 09:41:36,437 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 09:41:36,437 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 09:41:36,438 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 09:41:36,438 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 09:41:36,438 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 09:41:36,439 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 09:41:36,439 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 09:41:36,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-28 09:41:36,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-28 09:41:36,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 09:41:36,440 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 09:41:36,440 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 09:41:36,441 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 09:41:36,441 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 09:41:36,442 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 09:41:36,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-28 09:41:36,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-28 09:41:36,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 09:41:36,442 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 09:41:36,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:36,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-28 09:41:36,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-28 09:41:36,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-28 09:41:36,581 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 09:41:36,582 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 09:41:36,582 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 09:41:36,583 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 09:41:36,584 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 09:41:36,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 09:41:36,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-28 09:41:36,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-28 09:41:36,584 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 09:41:36,585 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 09:41:36,585 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 09:41:36,586 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 09:41:36,586 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 09:41:36,587 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 09:41:36,587 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 09:41:36,587 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 09:41:36,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-28 09:41:36,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-28 09:41:36,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-28 09:41:36,588 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 09:41:36,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-28 09:41:36,588 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 09:41:36,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750885036] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:36,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:36,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-28 09:41:36,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:36,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1877509369] [2022-04-28 09:41:36,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1877509369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:36,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:36,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:41:36,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499281570] [2022-04-28 09:41:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:36,590 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 09:41:36,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:36,591 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 09:41:36,609 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 09:41:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:41:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:41:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:41:36,611 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 09:41:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:36,819 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-28 09:41:36,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:41:36,819 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 09:41:36,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:36,820 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 09:41:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 09:41:36,823 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 09:41:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 09:41:36,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 09:41:36,853 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 09:41:36,858 INFO L225 Difference]: With dead ends: 46 [2022-04-28 09:41:36,858 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:41:36,858 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 09:41:36,863 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 09:41:36,864 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 09:41:36,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:41:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 09:41:36,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:36,873 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 09:41:36,873 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 09:41:36,873 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 09:41:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:36,877 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:41:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:41:36,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:36,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:36,879 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 09:41:36,879 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 09:41:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:36,883 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:41:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:41:36,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:36,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:36,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:36,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:36,883 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 09:41:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 09:41:36,884 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2022-04-28 09:41:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:36,885 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 09:41:36,885 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 09:41:36,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 09:41:36,911 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 09:41:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 09:41:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 09:41:36,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:36,915 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 09:41:36,934 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 09:41:37,136 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 09:41:37,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:37,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:37,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 3 times [2022-04-28 09:41:37,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:37,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777551619] [2022-04-28 09:41:37,140 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:37,140 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 4 times [2022-04-28 09:41:37,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:37,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601883757] [2022-04-28 09:41:37,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:37,288 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 09:41:37,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 09:41:37,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-28 09:41:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 09:41:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:37,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-28 09:41:37,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-28 09:41:37,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 09:41:37,308 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 09:41:37,308 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 09:41:37,308 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 09:41:37,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 09:41:37,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-28 09:41:37,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-28 09:41:37,309 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 09:41:37,309 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 09:41:37,310 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 09:41:37,310 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 09:41:37,311 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 09:41:37,312 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 09:41:37,312 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 09:41:37,313 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 09:41:37,313 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 09:41:37,313 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 09:41:37,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-28 09:41:37,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-28 09:41:37,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 09:41:37,326 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 09:41:37,326 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 09:41:37,327 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 09:41:37,327 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 09:41:37,328 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 09:41:37,328 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 09:41:37,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {933#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {917#false} is VALID [2022-04-28 09:41:37,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-28 09:41:37,329 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 09:41:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:37,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601883757] [2022-04-28 09:41:37,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601883757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:37,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095210463] [2022-04-28 09:41:37,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:41:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:37,340 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 09:41:37,341 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 09:41:37,389 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:41:37,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:37,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:41:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:37,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:37,449 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 09:41:38,837 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:41:38,838 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 09:41:38,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2022-04-28 09:41:38,932 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 09:41:38,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-28 09:41:38,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-28 09:41:38,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-28 09:41:38,933 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 09:41:38,934 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 09:41:38,935 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 09:41:38,935 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 09:41:38,936 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 09:41:38,938 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 09:41:38,940 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 09:41:38,941 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 09:41:38,942 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 09:41:38,943 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 09:41:38,944 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 09:41:38,944 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 09:41:38,945 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 09:41:38,948 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 09:41:38,949 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 09:41:38,954 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 09:41:38,957 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 09:41:38,958 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 09:41:38,958 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 09:41:38,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {1016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {917#false} is VALID [2022-04-28 09:41:38,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-28 09:41:38,959 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 09:41:38,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:39,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095210463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:39,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:41:39,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-04-28 09:41:39,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:39,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777551619] [2022-04-28 09:41:39,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777551619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:39,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:39,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:41:39,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902554955] [2022-04-28 09:41:39,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:39,342 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 09:41:39,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:39,342 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 09:41:39,363 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 09:41:39,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:41:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:41:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:41:39,365 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 09:41:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:39,959 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-28 09:41:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 09:41:39,960 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 09:41:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:39,960 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 09:41:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 09:41:39,962 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 09:41:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 09:41:39,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-28 09:41:39,996 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 09:41:39,997 INFO L225 Difference]: With dead ends: 42 [2022-04-28 09:41:39,997 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 09:41:39,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 09:41:39,998 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 09:41:39,998 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 09:41:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 09:41:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-28 09:41:40,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:40,006 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 09:41:40,006 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 09:41:40,006 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 09:41:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:40,007 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 09:41:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 09:41:40,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:40,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:40,008 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 09:41:40,008 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 09:41:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:40,009 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 09:41:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 09:41:40,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:40,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:40,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:40,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:40,010 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 09:41:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-28 09:41:40,010 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2022-04-28 09:41:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:40,011 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-28 09:41:40,011 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 09:41:40,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-28 09:41:40,053 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 09:41:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-28 09:41:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 09:41:40,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:40,054 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 09:41:40,071 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 09:41:40,261 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 09:41:40,261 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 5 times [2022-04-28 09:41:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:40,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1601687832] [2022-04-28 09:41:40,264 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:40,265 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 6 times [2022-04-28 09:41:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:40,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538076290] [2022-04-28 09:41:40,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:40,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:40,347 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 09:41:40,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-28 09:41:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 09:41:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:40,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 09:41:40,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 09:41:40,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,358 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 09:41:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 09:41:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:40,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 09:41:40,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 09:41:40,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,366 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 09:41:40,366 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 09:41:40,367 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 09:41:40,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-28 09:41:40,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-28 09:41:40,367 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 09:41:40,367 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 09:41:40,368 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 09:41:40,368 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 09:41:40,368 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 09:41:40,369 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 09:41:40,369 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 09:41:40,370 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 09:41:40,370 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 09:41:40,370 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 09:41:40,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 09:41:40,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 09:41:40,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,371 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 09:41:40,372 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 09:41:40,372 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 09:41:40,372 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 09:41:40,379 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 09:41:40,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 09:41:40,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 09:41:40,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,387 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 09:41:40,388 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 09:41:40,389 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 09:41:40,390 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 09:41:40,390 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 09:41:40,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 09:41:40,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 09:41:40,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 09:41:40,390 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 09:41:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:40,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538076290] [2022-04-28 09:41:40,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538076290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:40,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747529942] [2022-04-28 09:41:40,391 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:41:40,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:40,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:40,393 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 09:41:40,394 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 09:41:40,437 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:41:40,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:40,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:41:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:40,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:40,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-28 09:41:40,642 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 09:41:40,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-28 09:41:40,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-28 09:41:40,643 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 09:41:40,645 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 09:41:40,646 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 09:41:40,646 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 09:41:40,647 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 09:41:40,647 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 09:41:40,647 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 09:41:40,648 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 09:41:40,648 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 09:41:40,648 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 09:41:40,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 09:41:40,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 09:41:40,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,659 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 09:41:40,659 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 09:41:40,660 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 09:41:40,660 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 09:41:40,661 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 09:41:40,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 09:41:40,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 09:41:40,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,661 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 09:41:40,662 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 09:41:40,662 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 09:41:40,663 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 09:41:40,663 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 09:41:40,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 09:41:40,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 09:41:40,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 09:41:40,664 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 09:41:40,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:40,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-28 09:41:40,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-28 09:41:40,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-28 09:41:40,855 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 09:41:40,855 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 09:41:40,856 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 09:41:40,856 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 09:41:40,857 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 09:41:40,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 09:41:40,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 09:41:40,858 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 09:41:40,861 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 09:41:40,861 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 09:41:40,862 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 09:41:40,864 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 09:41:40,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-28 09:41:40,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-28 09:41:40,886 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 09:41:40,888 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 09:41:40,888 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 09:41:40,889 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 09:41:40,889 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 09:41:40,890 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 09:41:40,890 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 09:41:40,890 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 09:41:40,891 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 09:41:40,891 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 09:41:40,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-28 09:41:40,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-28 09:41:40,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-28 09:41:40,891 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 09:41:40,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-28 09:41:40,892 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 09:41:40,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747529942] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:40,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:40,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-04-28 09:41:40,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:40,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1601687832] [2022-04-28 09:41:40,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1601687832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:40,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:40,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:41:40,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28244973] [2022-04-28 09:41:40,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:40,893 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 09:41:40,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:40,894 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 09:41:40,915 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 09:41:40,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:41:40,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:40,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:41:40,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-28 09:41:40,916 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 09:41:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:41,214 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 09:41:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:41:41,214 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 09:41:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:41,215 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 09:41:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 09:41:41,220 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 09:41:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-28 09:41:41,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-28 09:41:41,265 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 09:41:41,268 INFO L225 Difference]: With dead ends: 60 [2022-04-28 09:41:41,268 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 09:41:41,269 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 09:41:41,269 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 09:41:41,269 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 09:41:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 09:41:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-28 09:41:41,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:41,285 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 09:41:41,286 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 09:41:41,286 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 09:41:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:41,292 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 09:41:41,292 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 09:41:41,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:41,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:41,295 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 09:41:41,295 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 09:41:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:41,297 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-28 09:41:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-28 09:41:41,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:41,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:41,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:41,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:41,299 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 09:41:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-28 09:41:41,300 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-28 09:41:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:41,300 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-28 09:41:41,301 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 09:41:41,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-28 09:41:41,336 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 09:41:41,337 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-28 09:41:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 09:41:41,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:41,337 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 09:41:41,354 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 09:41:41,551 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 09:41:41,551 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:41,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 7 times [2022-04-28 09:41:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:41,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2016057241] [2022-04-28 09:41:41,554 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:41,554 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 8 times [2022-04-28 09:41:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:41,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197168564] [2022-04-28 09:41:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:41,716 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 09:41:41,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 09:41:41,716 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-28 09:41:41,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:41:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:41,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-28 09:41:41,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-28 09:41:41,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 09:41:41,725 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 09:41:41,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:41:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:41,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-28 09:41:41,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-28 09:41:41,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 09:41:41,730 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 09:41:41,731 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 09:41:41,731 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 09:41:41,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 09:41:41,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-28 09:41:41,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-28 09:41:41,731 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 09:41:41,731 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 09:41:41,732 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 09:41:41,732 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 09:41:41,733 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 09:41:41,733 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 09:41:41,734 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 09:41:41,734 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 09:41:41,734 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 09:41:41,735 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 09:41:41,735 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 09:41:41,735 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 09:41:41,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-28 09:41:41,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-28 09:41:41,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 09:41:41,736 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 09:41:41,737 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 09:41:41,737 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 09:41:41,737 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 09:41:41,738 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 09:41:41,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-28 09:41:41,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-28 09:41:41,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 09:41:41,738 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 09:41:41,739 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 09:41:41,739 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 09:41:41,740 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 09:41:41,740 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 09:41:41,740 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 09:41:41,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {1850#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1828#false} is VALID [2022-04-28 09:41:41,741 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-28 09:41:41,741 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 09:41:41,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:41,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197168564] [2022-04-28 09:41:41,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197168564] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:41,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801446007] [2022-04-28 09:41:41,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:41:41,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:41,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:41,743 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 09:41:41,744 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 09:41:41,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:41:41,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:41,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 09:41:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:41,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:41,872 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 09:41:43,729 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:41:43,730 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 09:41:43,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {1827#true} call ULTIMATE.init(); {1827#true} is VALID [2022-04-28 09:41:43,794 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 09:41:43,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-28 09:41:43,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-28 09:41:43,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-28 09:41:43,794 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 09:41:43,795 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 09:41:43,795 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 09:41:43,796 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 09:41:43,796 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 09:41:43,796 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 09:41:43,797 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 09:41:43,799 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 09:41:43,799 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 09:41:43,800 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 09:41:43,800 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 09:41:43,803 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 09:41:43,804 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 09:41:43,804 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 09:41:43,805 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 09:41:43,805 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 09:41:43,806 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 09:41:43,807 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 09:41:43,807 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 09:41:43,810 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 09:41:43,810 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 09:41:43,811 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 09:41:43,811 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 09:41:43,812 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 09:41:43,812 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 09:41:43,813 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 09:41:43,814 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 09:41:43,814 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 09:41:43,815 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 09:41:43,815 INFO L290 TraceCheckUtils]: 34: Hoare triple {1965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1828#false} is VALID [2022-04-28 09:41:43,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-28 09:41:43,816 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 09:41:43,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:44,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801446007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:44,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:41:44,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-04-28 09:41:44,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:44,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2016057241] [2022-04-28 09:41:44,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2016057241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:44,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:44,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:41:44,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905155721] [2022-04-28 09:41:44,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:44,094 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 09:41:44,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:44,094 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 09:41:44,114 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 09:41:44,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:41:44,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:44,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:41:44,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2022-04-28 09:41:44,124 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 09:41:44,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:44,825 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-04-28 09:41:44,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 09:41:44,825 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 09:41:44,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:44,825 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 09:41:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-28 09:41:44,827 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 09:41:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-28 09:41:44,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-28 09:41:44,876 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 09:41:44,877 INFO L225 Difference]: With dead ends: 52 [2022-04-28 09:41:44,877 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 09:41:44,878 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 09:41:44,878 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 09:41:44,878 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 09:41:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 09:41:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-04-28 09:41:44,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:44,895 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 09:41:44,895 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 09:41:44,895 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 09:41:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:44,897 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 09:41:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-28 09:41:44,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:44,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:44,897 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 09:41:44,897 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 09:41:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:44,898 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 09:41:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-28 09:41:44,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:44,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:44,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:44,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:44,899 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 09:41:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-28 09:41:44,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2022-04-28 09:41:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:44,900 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-28 09:41:44,900 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 09:41:44,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-28 09:41:44,947 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 09:41:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-28 09:41:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 09:41:44,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:44,947 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 09:41:44,964 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 09:41:45,153 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 09:41:45,154 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:45,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 9 times [2022-04-28 09:41:45,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:45,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1443875326] [2022-04-28 09:41:45,165 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:45,165 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 10 times [2022-04-28 09:41:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460553984] [2022-04-28 09:41:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:45,265 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 09:41:45,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-28 09:41:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-28 09:41:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:45,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,274 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 09:41:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:41:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:45,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,278 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 09:41:45,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 09:41:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:45,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,284 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 09:41:45,285 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 09:41:45,285 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 09:41:45,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-28 09:41:45,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-28 09:41:45,285 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 09:41:45,285 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 09:41:45,286 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 09:41:45,286 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 09:41:45,286 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 09:41:45,287 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 09:41:45,288 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 09:41:45,288 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 09:41:45,288 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 09:41:45,289 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 09:41:45,289 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 09:41:45,289 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 09:41:45,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,290 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 09:41:45,290 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 09:41:45,291 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 09:41:45,291 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 09:41:45,291 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 09:41:45,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,292 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 09:41:45,292 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 09:41:45,293 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 09:41:45,293 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 09:41:45,293 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 09:41:45,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,294 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 09:41:45,294 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 09:41:45,295 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 09:41:45,295 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 09:41:45,295 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 09:41:45,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-28 09:41:45,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-28 09:41:45,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-28 09:41:45,296 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 09:41:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:45,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460553984] [2022-04-28 09:41:45,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460553984] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:45,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381767742] [2022-04-28 09:41:45,296 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:41:45,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:45,297 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 09:41:45,298 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 09:41:45,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:41:45,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:45,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:41:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:45,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:45,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-28 09:41:45,631 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 09:41:45,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-28 09:41:45,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-28 09:41:45,631 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 09:41:45,632 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 09:41:45,632 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 09:41:45,633 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 09:41:45,633 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 09:41:45,633 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 09:41:45,634 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 09:41:45,634 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 09:41:45,634 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 09:41:45,635 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 09:41:45,635 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 09:41:45,635 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 09:41:45,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,636 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 09:41:45,637 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 09:41:45,637 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 09:41:45,638 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 09:41:45,638 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 09:41:45,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,638 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 09:41:45,639 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 09:41:45,639 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 09:41:45,640 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 09:41:45,640 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 09:41:45,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,641 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 09:41:45,641 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 09:41:45,642 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 09:41:45,642 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 09:41:45,642 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 09:41:45,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-28 09:41:45,643 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-28 09:41:45,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-28 09:41:45,643 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 09:41:45,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:45,830 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-28 09:41:45,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-28 09:41:45,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-28 09:41:45,831 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 09:41:45,831 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 09:41:45,832 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 09:41:45,832 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 09:41:45,833 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 09:41:45,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,833 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 09:41:45,833 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 09:41:45,834 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 09:41:45,834 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 09:41:45,835 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 09:41:45,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,835 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 09:41:45,835 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 09:41:45,836 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 09:41:45,836 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 09:41:45,837 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 09:41:45,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-28 09:41:45,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-28 09:41:45,837 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 09:41:45,837 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 09:41:45,838 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 09:41:45,838 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 09:41:45,839 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 09:41:45,839 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 09:41:45,840 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 09:41:45,840 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 09:41:45,840 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 09:41:45,841 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 09:41:45,841 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 09:41:45,841 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 09:41:45,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-28 09:41:45,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-28 09:41:45,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-28 09:41:45,842 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 09:41:45,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-28 09:41:45,842 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 09:41:45,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381767742] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:45,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:45,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-04-28 09:41:45,842 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:45,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1443875326] [2022-04-28 09:41:45,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1443875326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:45,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:45,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 09:41:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854507460] [2022-04-28 09:41:45,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:45,843 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 09:41:45,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:45,844 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 09:41:45,867 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 09:41:45,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 09:41:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 09:41:45,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:41:45,868 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 09:41:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:46,304 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-28 09:41:46,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 09:41:46,304 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 09:41:46,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:46,304 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 09:41:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-28 09:41:46,306 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 09:41:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-28 09:41:46,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-28 09:41:46,347 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 09:41:46,348 INFO L225 Difference]: With dead ends: 74 [2022-04-28 09:41:46,348 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 09:41:46,349 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 09:41:46,350 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:46,350 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.2s Time] [2022-04-28 09:41:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 09:41:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-28 09:41:46,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:46,365 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 09:41:46,365 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 09:41:46,365 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 09:41:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:46,384 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 09:41:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-28 09:41:46,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:46,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:46,386 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 09:41:46,386 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 09:41:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:46,388 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-28 09:41:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-28 09:41:46,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:46,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:46,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:46,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:46,388 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 09:41:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-28 09:41:46,390 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2022-04-28 09:41:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:46,390 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-28 09:41:46,391 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 09:41:46,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-28 09:41:46,437 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 09:41:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-28 09:41:46,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 09:41:46,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:46,438 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 09:41:46,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 09:41:46,650 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 09:41:46,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 11 times [2022-04-28 09:41:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:46,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248991223] [2022-04-28 09:41:46,653 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:46,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:46,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 12 times [2022-04-28 09:41:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:46,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573633454] [2022-04-28 09:41:46,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:46,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:46,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:46,848 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 09:41:46,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:46,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-28 09:41:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 09:41:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:46,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 09:41:46,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 09:41:46,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:46,860 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 09:41:46,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:41:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:46,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 09:41:46,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 09:41:46,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:46,866 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 09:41:46,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 09:41:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:46,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 09:41:46,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 09:41:46,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:46,869 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 09:41:46,869 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 09:41:46,870 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 09:41:46,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:46,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-28 09:41:46,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-28 09:41:46,870 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 09:41:46,870 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 09:41:46,871 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 09:41:46,871 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 09:41:46,871 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 09:41:46,872 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 09:41:46,872 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 09:41:46,873 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 09:41:46,873 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 09:41:46,874 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 09:41:46,874 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 09:41:46,874 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 09:41:46,875 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 09:41:46,875 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 09:41:46,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 09:41:46,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 09:41:46,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:46,876 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 09:41:46,876 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 09:41:46,877 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 09:41:46,877 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 09:41:46,877 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 09:41:46,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 09:41:46,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 09:41:46,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:46,878 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 09:41:46,878 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 09:41:46,879 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 09:41:46,879 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 09:41:46,879 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 09:41:46,879 INFO L290 TraceCheckUtils]: 35: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-28 09:41:46,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-28 09:41:46,880 INFO L290 TraceCheckUtils]: 37: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:46,880 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 09:41:46,880 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 09:41:46,881 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 09:41:46,881 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 09:41:46,882 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 09:41:46,882 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 09:41:46,882 INFO L290 TraceCheckUtils]: 44: Hoare triple {3008#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2980#false} is VALID [2022-04-28 09:41:46,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-28 09:41:46,883 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 09:41:46,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:46,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573633454] [2022-04-28 09:41:46,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573633454] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:46,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608051231] [2022-04-28 09:41:46,884 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:41:46,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:46,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:46,885 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 09:41:46,886 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 09:41:46,941 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 09:41:46,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:46,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 09:41:46,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:46,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:47,084 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 09:41:49,733 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:41:49,734 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 09:41:49,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {2979#true} call ULTIMATE.init(); {2979#true} is VALID [2022-04-28 09:41:49,809 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 09:41:49,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-28 09:41:49,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-28 09:41:49,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-28 09:41:49,809 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 09:41:49,816 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 09:41:49,817 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 09:41:49,817 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 09:41:49,817 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 09:41:49,818 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 09:41:49,818 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 09:41:49,819 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 09:41:49,819 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 09:41:49,820 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 09:41:49,821 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 09:41:49,822 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 09:41:49,822 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 09:41:49,826 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 09:41:49,826 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 09:41:49,826 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 09:41:49,827 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 09:41:49,827 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 09:41:49,834 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 09:41:49,835 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 09:41:49,835 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 09:41:49,843 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 09:41:49,844 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 09:41:49,845 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 09:41:49,845 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 09:41:49,846 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 09:41:49,847 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 09:41:49,847 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 09:41:49,848 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 09:41:49,858 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 09:41:49,859 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 09:41:49,859 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 09:41:49,859 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 09:41:49,860 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 09:41:49,861 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 09:41:49,861 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 09:41:49,862 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 09:41:49,863 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 09:41:49,863 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 09:41:49,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {3155#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2980#false} is VALID [2022-04-28 09:41:49,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-28 09:41:49,864 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 09:41:49,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:50,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608051231] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:50,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:41:50,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-04-28 09:41:50,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:50,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248991223] [2022-04-28 09:41:50,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248991223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:50,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:50,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:41:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602980663] [2022-04-28 09:41:50,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:50,141 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 09:41:50,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:50,142 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 09:41:50,170 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 09:41:50,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:41:50,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:50,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:41:50,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-04-28 09:41:50,171 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 09:41:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:51,207 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-28 09:41:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 09:41:51,207 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 09:41:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:51,209 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 09:41:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 09:41:51,213 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 09:41:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-28 09:41:51,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-28 09:41:51,255 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 09:41:51,256 INFO L225 Difference]: With dead ends: 62 [2022-04-28 09:41:51,256 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 09:41:51,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1859, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 09:41:51,257 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 09:41:51,258 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 09:41:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 09:41:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-28 09:41:51,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:51,271 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 09:41:51,271 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 09:41:51,271 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 09:41:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:51,273 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-28 09:41:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-28 09:41:51,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:51,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:51,273 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 09:41:51,273 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 09:41:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:51,275 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-28 09:41:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-28 09:41:51,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:51,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:51,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:51,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:51,275 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 09:41:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-28 09:41:51,276 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2022-04-28 09:41:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:51,277 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-28 09:41:51,277 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 09:41:51,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 58 transitions. [2022-04-28 09:41:51,336 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 09:41:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-28 09:41:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 09:41:51,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:51,337 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 09:41:51,354 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 09:41:51,552 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 09:41:51,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 13 times [2022-04-28 09:41:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:51,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [246970002] [2022-04-28 09:41:51,555 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:51,556 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 14 times [2022-04-28 09:41:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187789440] [2022-04-28 09:41:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:51,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:51,671 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 09:41:51,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,672 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-28 09:41:51,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-28 09:41:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:51,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:51,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:51,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,693 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 09:41:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:41:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:51,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:51,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:51,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,698 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 09:41:51,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 09:41:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:51,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:51,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:51,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,702 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 09:41:51,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 09:41:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:51,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:51,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:51,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,705 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 09:41:51,706 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 09:41:51,706 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 09:41:51,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-28 09:41:51,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-28 09:41:51,706 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 09:41:51,707 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 09:41:51,707 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 09:41:51,707 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 09:41:51,707 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 09:41:51,708 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 09:41:51,708 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 09:41:51,709 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 09:41:51,709 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 09:41:51,709 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 09:41:51,710 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 09:41:51,710 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 09:41:51,710 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 09:41:51,710 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 09:41:51,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:51,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:51,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,711 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 09:41:51,711 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 09:41:51,712 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 09:41:51,712 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 09:41:51,712 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 09:41:51,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:51,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:51,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,713 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 09:41:51,713 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 09:41:51,714 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 09:41:51,714 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 09:41:51,716 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 09:41:51,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:51,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:51,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,717 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 09:41:51,717 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 09:41:51,718 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 09:41:51,718 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 09:41:51,718 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 09:41:51,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:51,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:51,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:51,719 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 09:41:51,719 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 09:41:51,720 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 09:41:51,720 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 09:41:51,720 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 09:41:51,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-28 09:41:51,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-28 09:41:51,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-28 09:41:51,721 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 09:41:51,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:51,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187789440] [2022-04-28 09:41:51,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187789440] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:51,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281993945] [2022-04-28 09:41:51,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:41:51,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:51,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:51,728 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 09:41:51,729 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 09:41:51,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:41:51,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:51,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:41:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:51,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:52,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-28 09:41:52,106 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 09:41:52,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-28 09:41:52,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-28 09:41:52,107 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 09:41:52,107 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 09:41:52,108 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 09:41:52,108 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 09:41:52,108 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 09:41:52,109 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 09:41:52,109 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 09:41:52,109 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 09:41:52,110 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 09:41:52,110 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 09:41:52,111 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 09:41:52,111 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 09:41:52,112 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 09:41:52,112 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 09:41:52,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:52,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:52,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,113 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 09:41:52,113 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 09:41:52,114 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 09:41:52,114 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 09:41:52,114 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 09:41:52,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:52,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:52,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,115 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 09:41:52,115 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 09:41:52,116 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 09:41:52,116 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 09:41:52,116 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 09:41:52,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:52,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:52,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,117 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 09:41:52,117 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 09:41:52,118 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 09:41:52,118 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 09:41:52,118 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 09:41:52,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:52,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:52,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,119 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 09:41:52,119 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 09:41:52,120 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 09:41:52,120 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 09:41:52,120 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 09:41:52,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-28 09:41:52,121 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-28 09:41:52,121 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-28 09:41:52,121 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 09:41:52,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:52,351 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-28 09:41:52,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-28 09:41:52,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-28 09:41:52,352 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 09:41:52,363 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 09:41:52,364 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 09:41:52,364 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 09:41:52,365 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 09:41:52,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:52,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:52,366 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 09:41:52,366 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 09:41:52,366 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 09:41:52,367 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 09:41:52,367 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 09:41:52,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:52,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:52,368 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 09:41:52,368 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 09:41:52,369 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 09:41:52,369 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 09:41:52,369 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 09:41:52,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:52,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:52,370 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 09:41:52,370 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 09:41:52,371 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 09:41:52,371 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 09:41:52,372 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 09:41:52,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-28 09:41:52,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-28 09:41:52,372 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 09:41:52,372 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 09:41:52,373 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 09:41:52,373 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 09:41:52,374 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 09:41:52,375 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 09:41:52,376 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 09:41:52,376 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 09:41:52,376 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 09:41:52,377 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 09:41:52,377 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 09:41:52,378 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 09:41:52,378 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 09:41:52,378 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 09:41:52,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-28 09:41:52,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-28 09:41:52,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-28 09:41:52,379 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 09:41:52,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-28 09:41:52,379 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 09:41:52,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281993945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:52,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:52,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-04-28 09:41:52,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:52,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [246970002] [2022-04-28 09:41:52,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [246970002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:52,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:52,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 09:41:52,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077581735] [2022-04-28 09:41:52,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:52,384 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 09:41:52,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:52,384 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 09:41:52,419 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 09:41:52,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 09:41:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:52,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 09:41:52,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-28 09:41:52,420 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 09:41:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:52,952 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-28 09:41:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 09:41:52,952 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 09:41:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:52,952 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 09:41:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 09:41:52,954 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 09:41:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-28 09:41:52,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-28 09:41:53,005 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 09:41:53,007 INFO L225 Difference]: With dead ends: 88 [2022-04-28 09:41:53,007 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 09:41:53,007 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 09:41:53,008 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 09:41:53,008 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 09:41:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 09:41:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 09:41:53,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:53,032 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 09:41:53,033 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 09:41:53,040 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 09:41:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:53,041 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-28 09:41:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-28 09:41:53,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:53,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:53,042 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 09:41:53,043 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 09:41:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:53,050 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-28 09:41:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-28 09:41:53,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:53,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:53,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:53,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:53,056 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 09:41:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-28 09:41:53,060 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2022-04-28 09:41:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:53,061 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-28 09:41:53,061 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 09:41:53,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-28 09:41:53,120 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 09:41:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-28 09:41:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 09:41:53,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:53,120 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 09:41:53,137 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 09:41:53,325 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 09:41:53,326 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:53,326 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 15 times [2022-04-28 09:41:53,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:53,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772096235] [2022-04-28 09:41:53,328 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:53,328 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 16 times [2022-04-28 09:41:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:53,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877534444] [2022-04-28 09:41:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:53,518 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 09:41:53,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-28 09:41:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-28 09:41:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:53,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 09:41:53,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 09:41:53,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,522 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 09:41:53,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 09:41:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:53,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 09:41:53,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 09:41:53,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,534 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 09:41:53,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 09:41:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:53,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 09:41:53,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 09:41:53,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,543 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 09:41:53,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 09:41:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:53,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 09:41:53,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 09:41:53,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,547 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 09:41:53,547 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 09:41:53,547 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 09:41:53,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-28 09:41:53,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-28 09:41:53,548 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 09:41:53,548 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 09:41:53,549 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 09:41:53,549 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 09:41:53,550 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 09:41:53,550 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 09:41:53,551 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 09:41:53,551 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 09:41:53,552 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 09:41:53,552 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 09:41:53,553 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 09:41:53,553 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 09:41:53,554 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 09:41:53,554 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 09:41:53,554 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 09:41:53,555 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 09:41:53,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 09:41:53,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 09:41:53,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,556 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 09:41:53,556 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 09:41:53,556 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 09:41:53,557 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 09:41:53,557 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 09:41:53,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 09:41:53,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 09:41:53,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,568 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 09:41:53,568 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 09:41:53,569 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 09:41:53,569 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 09:41:53,570 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 09:41:53,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 09:41:53,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 09:41:53,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,571 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 09:41:53,571 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 09:41:53,572 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 09:41:53,572 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 09:41:53,572 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 09:41:53,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-28 09:41:53,573 INFO L290 TraceCheckUtils]: 46: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-28 09:41:53,573 INFO L290 TraceCheckUtils]: 47: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:53,573 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 09:41:53,574 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 09:41:53,574 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 09:41:53,575 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 09:41:53,576 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 09:41:53,576 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 09:41:53,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {4407#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4373#false} is VALID [2022-04-28 09:41:53,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-28 09:41:53,577 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 09:41:53,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:53,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877534444] [2022-04-28 09:41:53,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877534444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:53,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575771406] [2022-04-28 09:41:53,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:41:53,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:53,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:53,579 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 09:41:53,584 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 09:41:53,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:41:53,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:53,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 09:41:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:53,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:53,812 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 09:41:57,303 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:41:57,304 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 09:41:57,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2022-04-28 09:41:57,386 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 09:41:57,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-28 09:41:57,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-28 09:41:57,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-28 09:41:57,386 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 09:41:57,387 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 09:41:57,387 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 09:41:57,388 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 09:41:57,388 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 09:41:57,388 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 09:41:57,389 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 09:41:57,389 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 09:41:57,389 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 09:41:57,390 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 09:41:57,390 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 09:41:57,392 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 09:41:57,392 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 09:41:57,393 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 09:41:57,394 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 09:41:57,401 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 09:41:57,401 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 09:41:57,401 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 09:41:57,402 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 09:41:57,402 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 09:41:57,403 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 09:41:57,404 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 09:41:57,404 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 09:41:57,407 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 09:41:57,408 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 09:41:57,408 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 09:41:57,408 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 09:41:57,409 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 09:41:57,410 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 09:41:57,411 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 09:41:57,412 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 09:41:57,417 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 09:41:57,418 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 09:41:57,418 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 09:41:57,418 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 09:41:57,419 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 09:41:57,420 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 09:41:57,420 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 09:41:57,421 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 09:41:57,426 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 09:41:57,427 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 09:41:57,427 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 09:41:57,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 09:41:57,428 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 09:41:57,429 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 09:41:57,429 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 09:41:57,430 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 09:41:57,430 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 09:41:57,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 09:41:57,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {4586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4373#false} is VALID [2022-04-28 09:41:57,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-28 09:41:57,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 09:41:57,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:57,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575771406] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:57,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:41:57,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2022-04-28 09:41:57,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:57,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772096235] [2022-04-28 09:41:57,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772096235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:57,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:57,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 09:41:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039840982] [2022-04-28 09:41:57,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:57,954 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 09:41:57,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:57,954 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 09:41:57,988 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 09:41:57,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 09:41:57,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 09:41:57,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 09:41:57,989 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 09:41:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:59,327 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-04-28 09:41:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 09:41:59,327 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 09:41:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:59,333 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 09:41:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-28 09:41:59,335 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 09:41:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-28 09:41:59,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 61 transitions. [2022-04-28 09:41:59,383 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 09:41:59,385 INFO L225 Difference]: With dead ends: 72 [2022-04-28 09:41:59,385 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 09:41:59,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=2401, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 09:41:59,386 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:59,386 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.6s Time] [2022-04-28 09:41:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 09:41:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-04-28 09:41:59,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:59,408 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 09:41:59,409 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 09:41:59,410 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 09:41:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:59,412 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-28 09:41:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-28 09:41:59,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:59,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:59,413 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 09:41:59,413 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 09:41:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:59,414 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-28 09:41:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-28 09:41:59,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:59,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:59,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:59,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:59,415 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 09:41:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-28 09:41:59,416 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2022-04-28 09:41:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:59,419 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-28 09:41:59,419 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 09:41:59,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-28 09:41:59,502 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 09:41:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-28 09:41:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 09:41:59,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:59,503 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 09:41:59,520 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 09:41:59,716 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 09:41:59,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 17 times [2022-04-28 09:41:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:59,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2043939242] [2022-04-28 09:41:59,718 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:41:59,718 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:41:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 18 times [2022-04-28 09:41:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:59,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227199877] [2022-04-28 09:41:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:59,867 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 09:41:59,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-28 09:41:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-28 09:41:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:59,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,874 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 09:41:59,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 09:41:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:59,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,878 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 09:41:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 09:41:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:59,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,881 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 09:41:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 09:41:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:59,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,885 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 09:41:59,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 09:41:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:59,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,888 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 09:41:59,889 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 09:41:59,889 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 09:41:59,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-28 09:41:59,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-28 09:41:59,889 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 09:41:59,889 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 09:41:59,890 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 09:41:59,890 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 09:41:59,890 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 09:41:59,891 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 09:41:59,891 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 09:41:59,907 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 09:41:59,907 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 09:41:59,907 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 09:41:59,908 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 09:41:59,908 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 09:41:59,909 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 09:41:59,909 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 09:41:59,909 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 09:41:59,909 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 09:41:59,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,910 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 09:41:59,911 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 09:41:59,911 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 09:41:59,911 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 09:41:59,911 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 09:41:59,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,912 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 09:41:59,912 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 09:41:59,913 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 09:41:59,913 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 09:41:59,913 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 09:41:59,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,914 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 09:41:59,914 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 09:41:59,915 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 09:41:59,915 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 09:41:59,915 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 09:41:59,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,916 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 09:41:59,916 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 09:41:59,917 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 09:41:59,917 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 09:41:59,917 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 09:41:59,917 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:41:59,918 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:41:59,918 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:41:59,918 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 09:41:59,918 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 09:41:59,919 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 09:41:59,919 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 09:41:59,919 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 09:41:59,919 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-28 09:41:59,919 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-28 09:41:59,920 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-28 09:41:59,920 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 09:41:59,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:59,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227199877] [2022-04-28 09:41:59,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227199877] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:59,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926413805] [2022-04-28 09:41:59,920 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:41:59,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:59,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:59,921 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 09:41:59,927 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 09:41:59,979 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 09:41:59,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:59,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:41:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:59,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:42:00,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-28 09:42:00,392 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 09:42:00,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-28 09:42:00,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-28 09:42:00,392 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 09:42:00,393 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 09:42:00,395 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 09:42:00,396 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 09:42:00,396 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 09:42:00,396 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 09:42:00,397 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 09:42:00,397 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 09:42:00,397 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 09:42:00,398 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 09:42:00,398 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 09:42:00,399 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 09:42:00,399 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 09:42:00,399 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 09:42:00,400 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 09:42:00,400 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 09:42:00,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,401 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 09:42:00,401 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 09:42:00,401 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 09:42:00,402 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 09:42:00,402 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 09:42:00,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,403 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 09:42:00,403 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 09:42:00,404 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 09:42:00,404 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 09:42:00,404 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 09:42:00,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,405 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 09:42:00,405 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 09:42:00,406 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 09:42:00,406 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 09:42:00,406 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 09:42:00,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,407 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 09:42:00,407 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 09:42:00,408 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 09:42:00,408 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 09:42:00,408 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 09:42:00,408 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,408 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,408 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,409 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 09:42:00,409 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 09:42:00,410 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 09:42:00,410 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 09:42:00,410 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 09:42:00,410 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-28 09:42:00,410 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-28 09:42:00,410 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-28 09:42:00,411 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 09:42:00,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:42:00,689 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-28 09:42:00,689 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-28 09:42:00,689 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-28 09:42:00,689 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 09:42:00,690 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 09:42:00,690 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 09:42:00,691 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 09:42:00,691 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 09:42:00,691 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,691 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,692 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 09:42:00,692 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 09:42:00,692 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 09:42:00,693 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 09:42:00,693 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 09:42:00,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,694 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 09:42:00,694 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 09:42:00,695 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 09:42:00,695 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 09:42:00,696 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 09:42:00,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,696 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 09:42:00,697 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 09:42:00,697 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 09:42:00,697 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 09:42:00,698 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 09:42:00,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,698 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 09:42:00,699 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 09:42:00,699 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 09:42:00,700 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 09:42:00,700 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 09:42:00,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-28 09:42:00,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-28 09:42:00,701 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 09:42:00,701 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 09:42:00,702 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 09:42:00,702 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 09:42:00,703 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 09:42:00,703 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 09:42:00,703 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 09:42:00,704 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 09:42:00,704 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 09:42:00,704 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 09:42:00,705 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 09:42:00,705 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 09:42:00,705 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 09:42:00,706 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 09:42:00,706 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 09:42:00,706 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 09:42:00,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-28 09:42:00,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-28 09:42:00,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-28 09:42:00,707 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 09:42:00,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-28 09:42:00,707 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 09:42:00,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926413805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:42:00,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:42:00,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-04-28 09:42:00,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:42:00,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2043939242] [2022-04-28 09:42:00,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2043939242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:42:00,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:42:00,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 09:42:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967846378] [2022-04-28 09:42:00,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:42:00,709 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 09:42:00,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:42:00,709 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 09:42:00,742 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 09:42:00,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 09:42:00,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:00,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 09:42:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-04-28 09:42:00,743 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 09:42:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:01,336 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-28 09:42:01,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 09:42:01,336 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 09:42:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:42:01,337 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 09:42:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-28 09:42:01,338 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 09:42:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-28 09:42:01,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-28 09:42:01,391 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 09:42:01,392 INFO L225 Difference]: With dead ends: 102 [2022-04-28 09:42:01,392 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 09:42:01,393 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 09:42:01,394 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 09:42:01,394 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 09:42:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 09:42:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-28 09:42:01,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:42:01,426 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 09:42:01,426 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 09:42:01,427 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 09:42:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:01,429 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-28 09:42:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-28 09:42:01,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:01,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:01,430 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 09:42:01,430 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 09:42:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:01,431 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-28 09:42:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-28 09:42:01,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:01,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:01,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:42:01,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:42:01,432 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 09:42:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-28 09:42:01,433 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2022-04-28 09:42:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:42:01,433 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-28 09:42:01,433 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 09:42:01,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-28 09:42:01,533 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 09:42:01,533 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-28 09:42:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 09:42:01,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:42:01,534 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 09:42:01,550 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 09:42:01,735 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 09:42:01,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:42:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:42:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 19 times [2022-04-28 09:42:01,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:01,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [150382746] [2022-04-28 09:42:01,738 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:42:01,738 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:42:01,738 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 20 times [2022-04-28 09:42:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:42:01,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981397465] [2022-04-28 09:42:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:42:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:42:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:01,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:42:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:01,984 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 09:42:01,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:01,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-28 09:42:01,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 09:42:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:01,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:01,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:01,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:01,988 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 09:42:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 09:42:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:01,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:01,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:01,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:01,992 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 09:42:01,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:42:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:01,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:01,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:01,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:01,996 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 09:42:01,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 09:42:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:01,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:01,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:01,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:01,999 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 09:42:01,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 09:42:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:02,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:02,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:02,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:02,003 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 09:42:02,003 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 09:42:02,003 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 09:42:02,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:02,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-28 09:42:02,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-28 09:42:02,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {6006#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6006#true} is VALID [2022-04-28 09:42:02,004 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 09:42:02,004 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 09:42:02,005 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 09:42:02,005 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 09:42:02,005 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 09:42:02,006 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 09:42:02,006 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 09:42:02,007 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 09:42:02,007 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 09:42:02,007 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 09:42:02,008 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 09:42:02,008 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 09:42:02,009 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 09:42:02,009 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 09:42:02,010 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 09:42:02,010 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 09:42:02,010 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 09:42:02,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:02,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:02,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:02,011 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 09:42:02,011 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 09:42:02,012 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 09:42:02,012 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 09:42:02,012 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 09:42:02,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:02,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:02,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:02,013 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 09:42:02,013 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 09:42:02,014 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 09:42:02,014 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 09:42:02,014 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 09:42:02,014 INFO L290 TraceCheckUtils]: 39: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:02,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:02,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:02,015 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 09:42:02,015 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 09:42:02,016 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 09:42:02,016 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 09:42:02,016 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 09:42:02,016 INFO L290 TraceCheckUtils]: 47: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:02,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:02,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:02,017 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 09:42:02,018 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 09:42:02,018 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 09:42:02,018 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 09:42:02,019 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 09:42:02,019 INFO L290 TraceCheckUtils]: 55: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-28 09:42:02,019 INFO L290 TraceCheckUtils]: 56: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-28 09:42:02,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:02,019 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 09:42:02,020 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 09:42:02,020 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 09:42:02,020 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 09:42:02,021 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 09:42:02,021 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 09:42:02,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {6047#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6007#false} is VALID [2022-04-28 09:42:02,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-28 09:42:02,022 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 09:42:02,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:42:02,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981397465] [2022-04-28 09:42:02,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981397465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:02,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304819658] [2022-04-28 09:42:02,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:42:02,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:42:02,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:42:02,024 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 09:42:02,025 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 09:42:02,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:42:02,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:42:02,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 09:42:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:02,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:42:02,272 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 09:42:06,527 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:42:06,527 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 09:42:06,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-28 09:42:06,618 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 09:42:06,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-28 09:42:06,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-28 09:42:06,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-28 09:42:06,618 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 09:42:06,619 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 09:42:06,619 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 09:42:06,619 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 09:42:06,620 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 09:42:06,620 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 09:42:06,621 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 09:42:06,621 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 09:42:06,621 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 09:42:06,622 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 09:42:06,622 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 09:42:06,622 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 09:42:06,623 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 09:42:06,625 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 09:42:06,626 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 09:42:06,626 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 09:42:06,627 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 09:42:06,631 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 09:42:06,631 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 09:42:06,632 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 09:42:06,635 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 09:42:06,635 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 09:42:06,636 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 09:42:06,637 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 09:42:06,637 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 09:42:06,642 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 09:42:06,642 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 09:42:06,643 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 09:42:06,643 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 09:42:06,644 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 09:42:06,644 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 09:42:06,645 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 09:42:06,646 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 09:42:06,649 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 09:42:06,650 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 09:42:06,650 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 09:42:06,650 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 09:42:06,653 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 09:42:06,654 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 09:42:06,655 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 09:42:06,656 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 09:42:06,660 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 09:42:06,660 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 09:42:06,660 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 09:42:06,661 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 09:42:06,661 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 09:42:06,662 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 09:42:06,663 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 09:42:06,664 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 09:42:06,667 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 09:42:06,667 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 09:42:06,668 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 09:42:06,668 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 09:42:06,669 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 09:42:06,669 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 09:42:06,670 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 09:42:06,671 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 09:42:06,671 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 09:42:06,672 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 09:42:06,672 INFO L290 TraceCheckUtils]: 64: Hoare triple {6258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6007#false} is VALID [2022-04-28 09:42:06,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-28 09:42:06,673 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 09:42:06,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:42:06,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304819658] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:06,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:42:06,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2022-04-28 09:42:06,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:42:06,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [150382746] [2022-04-28 09:42:06,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [150382746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:42:06,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:42:06,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 09:42:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730568994] [2022-04-28 09:42:06,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:42:06,940 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 09:42:06,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:42:06,940 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 09:42:06,974 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 09:42:06,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 09:42:06,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 09:42:06,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 09:42:06,975 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 09:42:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:08,558 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-28 09:42:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 09:42:08,558 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 09:42:08,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:42:08,558 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 09:42:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-28 09:42:08,559 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 09:42:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-28 09:42:08,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2022-04-28 09:42:08,628 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 09:42:08,629 INFO L225 Difference]: With dead ends: 82 [2022-04-28 09:42:08,629 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 09:42:08,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=295, Invalid=3011, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 09:42:08,632 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 09:42:08,632 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 09:42:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 09:42:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-28 09:42:08,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:42:08,679 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 09:42:08,679 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 09:42:08,680 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 09:42:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:08,681 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-28 09:42:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-28 09:42:08,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:08,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:08,681 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 09:42:08,682 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 09:42:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:08,683 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-28 09:42:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-28 09:42:08,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:08,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:08,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:42:08,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:42:08,684 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 09:42:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-28 09:42:08,685 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2022-04-28 09:42:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:42:08,685 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-28 09:42:08,686 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 09:42:08,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-28 09:42:08,808 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 09:42:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-28 09:42:08,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 09:42:08,809 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:42:08,809 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 09:42:08,839 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 09:42:09,023 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 09:42:09,024 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:42:09,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:42:09,024 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 21 times [2022-04-28 09:42:09,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:09,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114786422] [2022-04-28 09:42:09,027 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:42:09,027 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:42:09,027 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 22 times [2022-04-28 09:42:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:42:09,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064202356] [2022-04-28 09:42:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:42:09,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:42:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:42:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,212 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 09:42:09,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-28 09:42:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 09:42:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,218 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 09:42:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 09:42:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,223 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 09:42:09,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:42:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,227 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 09:42:09,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 09:42:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,231 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 09:42:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 09:42:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,236 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 09:42:09,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 09:42:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,240 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 09:42:09,241 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 09:42:09,241 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 09:42:09,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-28 09:42:09,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-28 09:42:09,241 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 09:42:09,241 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 09:42:09,242 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 09:42:09,242 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 09:42:09,243 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 09:42:09,243 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 09:42:09,243 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 09:42:09,244 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 09:42:09,244 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 09:42:09,245 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 09:42:09,245 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 09:42:09,245 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 09:42:09,246 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 09:42:09,246 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 09:42:09,247 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 09:42:09,247 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 09:42:09,247 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 09:42:09,248 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 09:42:09,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,248 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 09:42:09,249 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 09:42:09,249 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 09:42:09,250 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 09:42:09,250 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 09:42:09,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,250 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 09:42:09,251 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 09:42:09,251 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 09:42:09,252 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 09:42:09,252 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 09:42:09,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,252 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,253 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 09:42:09,253 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 09:42:09,253 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 09:42:09,254 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 09:42:09,254 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 09:42:09,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,255 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 09:42:09,255 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 09:42:09,256 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 09:42:09,256 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 09:42:09,256 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 09:42:09,256 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,256 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,256 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,257 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 09:42:09,257 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 09:42:09,258 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 09:42:09,258 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 09:42:09,258 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 09:42:09,258 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,259 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,259 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,259 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 09:42:09,259 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 09:42:09,260 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 09:42:09,260 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 09:42:09,260 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 09:42:09,261 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-28 09:42:09,261 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-28 09:42:09,261 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-28 09:42:09,261 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 09:42:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:42:09,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064202356] [2022-04-28 09:42:09,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064202356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:09,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055602437] [2022-04-28 09:42:09,262 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:42:09,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:42:09,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:42:09,268 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 09:42:09,291 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 09:42:09,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:42:09,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:42:09,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:42:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:09,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:42:09,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-28 09:42:09,878 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 09:42:09,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-28 09:42:09,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-28 09:42:09,878 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 09:42:09,879 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 09:42:09,879 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 09:42:09,880 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 09:42:09,880 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 09:42:09,880 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 09:42:09,881 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 09:42:09,881 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 09:42:09,881 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 09:42:09,882 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 09:42:09,882 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 09:42:09,883 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 09:42:09,883 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 09:42:09,883 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 09:42:09,884 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 09:42:09,884 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 09:42:09,885 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 09:42:09,885 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 09:42:09,885 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,886 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 09:42:09,886 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 09:42:09,886 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 09:42:09,887 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 09:42:09,887 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 09:42:09,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,888 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 09:42:09,888 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 09:42:09,889 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 09:42:09,889 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 09:42:09,889 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 09:42:09,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,890 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 09:42:09,890 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 09:42:09,891 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 09:42:09,891 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 09:42:09,891 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 09:42:09,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,892 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 09:42:09,893 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 09:42:09,893 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 09:42:09,894 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 09:42:09,894 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 09:42:09,894 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,894 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,894 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,894 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 09:42:09,895 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 09:42:09,895 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 09:42:09,896 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 09:42:09,896 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 09:42:09,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:09,896 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:09,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:09,897 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 09:42:09,897 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 09:42:09,898 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 09:42:09,898 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 09:42:09,898 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 09:42:09,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-28 09:42:09,898 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-28 09:42:09,898 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-28 09:42:09,899 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 09:42:09,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:42:10,216 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-28 09:42:10,216 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-28 09:42:10,216 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-28 09:42:10,216 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 09:42:10,217 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 09:42:10,217 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 09:42:10,217 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 09:42:10,218 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 09:42:10,218 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:10,218 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:10,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:10,218 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 09:42:10,219 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 09:42:10,219 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 09:42:10,219 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 09:42:10,220 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 09:42:10,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:10,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:10,220 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:10,220 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 09:42:10,221 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 09:42:10,221 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 09:42:10,221 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 09:42:10,222 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 09:42:10,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:10,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:10,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:10,225 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 09:42:10,225 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 09:42:10,226 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 09:42:10,226 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 09:42:10,227 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 09:42:10,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:10,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:10,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:10,227 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 09:42:10,227 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 09:42:10,228 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 09:42:10,228 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 09:42:10,229 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 09:42:10,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:10,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:10,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:10,235 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 09:42:10,236 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 09:42:10,237 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 09:42:10,237 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 09:42:10,238 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 09:42:10,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:10,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-28 09:42:10,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-28 09:42:10,238 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 09:42:10,239 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 09:42:10,239 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 09:42:10,239 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 09:42:10,240 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 09:42:10,240 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 09:42:10,240 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 09:42:10,241 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 09:42:10,241 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 09:42:10,241 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 09:42:10,242 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 09:42:10,242 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 09:42:10,242 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 09:42:10,243 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 09:42:10,243 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 09:42:10,243 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 09:42:10,244 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 09:42:10,244 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 09:42:10,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-28 09:42:10,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-28 09:42:10,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-28 09:42:10,244 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 09:42:10,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-28 09:42:10,245 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 09:42:10,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055602437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:42:10,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:42:10,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-04-28 09:42:10,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:42:10,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [114786422] [2022-04-28 09:42:10,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [114786422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:42:10,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:42:10,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 09:42:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979381237] [2022-04-28 09:42:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:42:10,246 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 09:42:10,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:42:10,247 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 09:42:10,281 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 09:42:10,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 09:42:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:10,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 09:42:10,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-28 09:42:10,282 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 09:42:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:10,995 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-04-28 09:42:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 09:42:10,995 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 09:42:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:42:10,996 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 09:42:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-28 09:42:10,997 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 09:42:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-28 09:42:10,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2022-04-28 09:42:11,056 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 09:42:11,057 INFO L225 Difference]: With dead ends: 116 [2022-04-28 09:42:11,057 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 09:42:11,058 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 09:42:11,058 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:42:11,059 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.3s Time] [2022-04-28 09:42:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 09:42:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-28 09:42:11,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:42:11,088 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 09:42:11,088 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 09:42:11,089 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 09:42:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:11,091 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-28 09:42:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-28 09:42:11,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:11,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:11,091 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 09:42:11,091 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 09:42:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:11,092 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-28 09:42:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-28 09:42:11,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:11,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:11,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:42:11,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:42:11,093 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 09:42:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-28 09:42:11,094 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-28 09:42:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:42:11,094 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-28 09:42:11,094 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 09:42:11,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-28 09:42:11,187 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 09:42:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-28 09:42:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 09:42:11,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:42:11,187 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 09:42:11,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 09:42:11,388 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 09:42:11,388 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:42:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:42:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 23 times [2022-04-28 09:42:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:11,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1125489159] [2022-04-28 09:42:11,391 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:42:11,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:42:11,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 24 times [2022-04-28 09:42:11,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:42:11,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244518902] [2022-04-28 09:42:11,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:42:11,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:42:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:42:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,659 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 09:42:11,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-28 09:42:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:42:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,665 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 09:42:11,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 09:42:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,668 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 09:42:11,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 09:42:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,671 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 09:42:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:42:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,674 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 09:42:11,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 09:42:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,677 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 09:42:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 09:42:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,680 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 09:42:11,680 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 09:42:11,681 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 09:42:11,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-28 09:42:11,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-28 09:42:11,681 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 09:42:11,681 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 09:42:11,682 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 09:42:11,682 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 09:42:11,682 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 09:42:11,683 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 09:42:11,683 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 09:42:11,684 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 09:42:11,684 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 09:42:11,684 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 09:42:11,685 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 09:42:11,685 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 09:42:11,686 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 09:42:11,686 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 09:42:11,686 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 09:42:11,687 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 09:42:11,687 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 09:42:11,688 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 09:42:11,695 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 09:42:11,695 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 09:42:11,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,696 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 09:42:11,697 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 09:42:11,697 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 09:42:11,698 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 09:42:11,698 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 09:42:11,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,699 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 09:42:11,699 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 09:42:11,700 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 09:42:11,700 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 09:42:11,700 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 09:42:11,700 INFO L290 TraceCheckUtils]: 41: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,700 INFO L290 TraceCheckUtils]: 42: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,701 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 09:42:11,701 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 09:42:11,702 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 09:42:11,702 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 09:42:11,702 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 09:42:11,702 INFO L290 TraceCheckUtils]: 49: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,702 INFO L290 TraceCheckUtils]: 50: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,702 INFO L290 TraceCheckUtils]: 51: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,703 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 09:42:11,703 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 09:42:11,704 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 09:42:11,704 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 09:42:11,704 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 09:42:11,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,705 INFO L290 TraceCheckUtils]: 58: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,705 INFO L290 TraceCheckUtils]: 59: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,705 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 09:42:11,705 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 09:42:11,706 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 09:42:11,706 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 09:42:11,707 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 09:42:11,707 INFO L290 TraceCheckUtils]: 65: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-28 09:42:11,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-28 09:42:11,707 INFO L290 TraceCheckUtils]: 67: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:11,707 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 09:42:11,708 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 09:42:11,708 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 09:42:11,709 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 09:42:11,709 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 09:42:11,709 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 09:42:11,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {7928#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7882#false} is VALID [2022-04-28 09:42:11,710 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-28 09:42:11,710 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 09:42:11,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:42:11,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244518902] [2022-04-28 09:42:11,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244518902] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:11,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449562567] [2022-04-28 09:42:11,713 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:42:11,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:42:11,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:42:11,714 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 09:42:11,715 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 09:42:11,786 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 09:42:11,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:42:11,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 09:42:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:11,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:42:12,000 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 09:42:16,793 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:42:16,794 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 09:42:16,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {7881#true} call ULTIMATE.init(); {7881#true} is VALID [2022-04-28 09:42:16,877 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 09:42:16,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-28 09:42:16,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-28 09:42:16,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-28 09:42:16,878 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 09:42:16,878 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 09:42:16,878 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 09:42:16,879 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 09:42:16,879 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 09:42:16,879 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 09:42:16,880 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 09:42:16,880 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 09:42:16,880 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 09:42:16,881 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 09:42:16,881 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 09:42:16,882 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 09:42:16,882 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 09:42:16,882 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 09:42:16,883 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 09:42:16,884 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 09:42:16,885 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 09:42:16,885 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 09:42:16,886 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 09:42:16,889 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 09:42:16,890 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 09:42:16,892 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 09:42:16,893 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 09:42:16,893 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 09:42:16,894 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 09:42:16,894 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 09:42:16,895 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 09:42:16,900 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 09:42:16,902 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 09:42:16,902 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 09:42:16,904 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 09:42:16,904 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 09:42:16,905 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 09:42:16,905 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 09:42:16,906 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 09:42:16,911 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 09:42:16,913 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 09:42:16,913 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 09:42:16,914 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 09:42:16,914 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 09:42:16,915 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 09:42:16,916 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 09:42:16,916 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 09:42:16,919 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 09:42:16,920 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 09:42:16,920 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 09:42:16,921 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 09:42:16,922 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 09:42:16,922 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 09:42:16,923 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 09:42:16,923 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 09:42:16,926 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 09:42:16,930 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 09:42:16,930 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 09:42:16,931 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 09:42:16,932 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 09:42:16,932 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 09:42:16,933 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 09:42:16,933 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 09:42:16,941 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 09:42:16,943 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 09:42:16,946 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 09:42:16,947 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 09:42:16,947 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 09:42:16,948 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 09:42:16,948 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 09:42:16,949 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 09:42:16,949 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 09:42:16,950 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 09:42:16,950 INFO L290 TraceCheckUtils]: 74: Hoare triple {8171#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7882#false} is VALID [2022-04-28 09:42:16,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-28 09:42:16,951 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 09:42:16,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:42:17,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449562567] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:17,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:42:17,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-04-28 09:42:17,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:42:17,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1125489159] [2022-04-28 09:42:17,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1125489159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:42:17,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:42:17,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 09:42:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832007762] [2022-04-28 09:42:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:42:17,234 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 09:42:17,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:42:17,235 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 09:42:17,275 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 09:42:17,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 09:42:17,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 09:42:17,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 09:42:17,276 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 09:42:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:19,357 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-28 09:42:19,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 09:42:19,358 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 09:42:19,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:42:19,358 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 09:42:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 09:42:19,359 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 09:42:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 09:42:19,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-28 09:42:19,432 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 09:42:19,433 INFO L225 Difference]: With dead ends: 92 [2022-04-28 09:42:19,433 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 09:42:19,434 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 09:42:19,434 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 09:42:19,434 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 09:42:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 09:42:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-04-28 09:42:19,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:42:19,466 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 09:42:19,466 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 09:42:19,466 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 09:42:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:19,467 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 09:42:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-28 09:42:19,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:19,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:19,468 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 09:42:19,468 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 09:42:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:19,472 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 09:42:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-28 09:42:19,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:19,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:19,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:42:19,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:42:19,472 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 09:42:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-28 09:42:19,474 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2022-04-28 09:42:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:42:19,474 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-28 09:42:19,474 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 09:42:19,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-28 09:42:19,579 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 09:42:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-28 09:42:19,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-28 09:42:19,580 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:42:19,580 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 09:42:19,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-28 09:42:19,781 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 09:42:19,781 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:42:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:42:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 25 times [2022-04-28 09:42:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:19,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1440023401] [2022-04-28 09:42:19,786 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:42:19,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:42:19,786 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 26 times [2022-04-28 09:42:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:42:19,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528581096] [2022-04-28 09:42:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:42:19,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:42:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:42:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,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 09:42:19,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:19,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-28 09:42:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-28 09:42:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:19,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:19,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:19,982 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 09:42:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 09:42:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:19,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:19,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:19,985 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 09:42:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 09:42:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:19,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:19,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:19,988 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 09:42:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:42:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:19,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:19,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:19,991 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 09:42:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 09:42:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:19,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:19,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:19,994 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 09:42:19,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 09:42:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:19,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:19,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:19,996 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 09:42:19,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:42:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:19,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:19,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:19,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:19,999 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 09:42:20,000 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 09:42:20,000 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 09:42:20,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-28 09:42:20,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-28 09:42:20,000 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 09:42:20,000 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 09:42:20,001 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 09:42:20,001 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 09:42:20,001 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 09:42:20,002 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 09:42:20,002 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 09:42:20,003 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 09:42:20,003 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 09:42:20,003 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 09:42:20,004 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 09:42:20,004 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 09:42:20,004 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 09:42:20,005 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 09:42:20,005 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 09:42:20,006 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 09:42:20,006 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 09:42:20,006 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 09:42:20,007 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 09:42:20,007 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 09:42:20,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,008 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 09:42:20,008 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 09:42:20,008 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 09:42:20,009 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 09:42:20,009 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 09:42:20,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,010 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 09:42:20,010 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 09:42:20,011 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 09:42:20,011 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 09:42:20,011 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 09:42:20,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,011 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,012 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 09:42:20,012 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 09:42:20,013 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 09:42:20,013 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 09:42:20,013 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 09:42:20,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,014 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 09:42:20,014 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 09:42:20,015 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 09:42:20,015 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 09:42:20,015 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 09:42:20,015 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,015 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,016 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 09:42:20,016 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 09:42:20,017 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 09:42:20,017 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 09:42:20,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 09:42:20,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,017 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,018 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,018 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 09:42:20,018 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 09:42:20,019 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 09:42:20,019 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 09:42:20,019 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 09:42:20,019 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,020 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,020 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,020 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 09:42:20,020 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 09:42:20,021 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 09:42:20,021 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 09:42:20,021 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 09:42:20,021 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-28 09:42:20,022 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-28 09:42:20,022 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-28 09:42:20,022 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 09:42:20,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:42:20,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528581096] [2022-04-28 09:42:20,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528581096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:20,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672339477] [2022-04-28 09:42:20,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:42:20,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:42:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:42:20,028 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 09:42:20,029 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 09:42:20,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:42:20,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:42:20,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 09:42:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:20,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:42:20,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-28 09:42:20,673 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 09:42:20,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-28 09:42:20,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-28 09:42:20,673 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 09:42:20,673 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 09:42:20,674 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 09:42:20,674 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 09:42:20,674 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 09:42:20,675 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 09:42:20,675 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 09:42:20,676 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 09:42:20,676 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 09:42:20,676 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 09:42:20,677 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 09:42:20,677 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 09:42:20,677 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 09:42:20,678 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 09:42:20,678 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 09:42:20,678 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 09:42:20,679 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 09:42:20,679 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 09:42:20,679 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 09:42:20,680 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 09:42:20,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,680 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 09:42:20,681 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 09:42:20,681 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 09:42:20,681 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 09:42:20,682 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 09:42:20,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,682 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 09:42:20,683 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 09:42:20,683 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 09:42:20,683 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 09:42:20,684 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 09:42:20,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,684 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 09:42:20,685 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 09:42:20,685 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 09:42:20,685 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 09:42:20,685 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 09:42:20,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,686 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,686 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,686 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 09:42:20,687 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 09:42:20,687 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 09:42:20,687 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 09:42:20,687 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 09:42:20,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,688 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 09:42:20,688 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 09:42:20,689 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 09:42:20,689 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 09:42:20,689 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 09:42:20,690 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,690 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,690 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 09:42:20,690 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 09:42:20,691 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 09:42:20,691 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 09:42:20,691 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 09:42:20,691 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:20,692 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:20,692 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:20,692 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 09:42:20,692 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 09:42:20,693 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 09:42:20,693 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 09:42:20,693 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 09:42:20,693 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-28 09:42:20,694 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-28 09:42:20,694 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-28 09:42:20,694 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 09:42:20,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:42:21,037 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-28 09:42:21,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-28 09:42:21,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-28 09:42:21,037 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 09:42:21,037 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 09:42:21,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 09:42:21,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 09:42:21,039 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 09:42:21,039 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:21,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:21,039 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:21,039 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 09:42:21,039 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 09:42:21,040 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 09:42:21,040 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 09:42:21,041 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 09:42:21,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:21,041 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:21,041 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:21,041 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 09:42:21,041 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 09:42:21,042 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 09:42:21,042 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 09:42:21,042 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 09:42:21,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:21,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:21,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:21,043 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 09:42:21,043 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 09:42:21,044 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 09:42:21,044 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 09:42:21,044 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 09:42:21,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:21,045 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:21,045 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:21,045 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 09:42:21,045 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 09:42:21,045 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 09:42:21,046 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 09:42:21,046 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 09:42:21,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:21,046 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:21,047 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:21,047 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 09:42:21,047 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 09:42:21,047 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 09:42:21,048 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 09:42:21,048 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 09:42:21,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:21,048 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:21,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:21,048 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 09:42:21,049 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 09:42:21,049 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 09:42:21,050 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 09:42:21,050 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 09:42:21,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:21,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-28 09:42:21,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-28 09:42:21,050 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 09:42:21,051 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 09:42:21,051 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 09:42:21,051 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 09:42:21,052 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 09:42:21,052 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 09:42:21,052 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 09:42:21,053 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 09:42:21,057 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 09:42:21,058 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 09:42:21,058 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 09:42:21,059 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 09:42:21,061 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 09:42:21,062 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 09:42:21,063 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 09:42:21,063 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 09:42:21,064 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 09:42:21,073 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 09:42:21,074 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 09:42:21,075 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 09:42:21,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-28 09:42:21,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-28 09:42:21,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-28 09:42:21,075 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 09:42:21,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-28 09:42:21,075 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 09:42:21,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672339477] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:42:21,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:42:21,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 30 [2022-04-28 09:42:21,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:42:21,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1440023401] [2022-04-28 09:42:21,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1440023401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:42:21,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:42:21,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 09:42:21,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424207083] [2022-04-28 09:42:21,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:42:21,077 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 09:42:21,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:42:21,077 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 09:42:21,115 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 09:42:21,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 09:42:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:21,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 09:42:21,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-28 09:42:21,116 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 09:42:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:21,834 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-04-28 09:42:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 09:42:21,834 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 09:42:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:42:21,835 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 09:42:21,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-28 09:42:21,836 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 09:42:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-28 09:42:21,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-28 09:42:21,897 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 09:42:21,899 INFO L225 Difference]: With dead ends: 130 [2022-04-28 09:42:21,899 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 09:42:21,900 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 09:42:21,902 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 09:42:21,902 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 09:42:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 09:42:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-28 09:42:21,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:42:21,938 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 09:42:21,938 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 09:42:21,938 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 09:42:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:21,940 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 09:42:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-28 09:42:21,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:21,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:21,940 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 09:42:21,940 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 09:42:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:21,942 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-28 09:42:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-28 09:42:21,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:21,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:21,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:42:21,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:42:21,942 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 09:42:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-28 09:42:21,944 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2022-04-28 09:42:21,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:42:21,944 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-28 09:42:21,944 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 09:42:21,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 90 transitions. [2022-04-28 09:42:22,048 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 09:42:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-28 09:42:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 09:42:22,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:42:22,049 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 09:42:22,065 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 09:42:22,254 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 09:42:22,254 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:42:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:42:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 27 times [2022-04-28 09:42:22,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:22,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620424758] [2022-04-28 09:42:22,256 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:42:22,256 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:42:22,257 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 28 times [2022-04-28 09:42:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:42:22,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377436447] [2022-04-28 09:42:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:42:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:42:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:42:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,569 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 09:42:22,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-28 09:42:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:42:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,573 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 09:42:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 09:42:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,577 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 09:42:22,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 09:42:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,580 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 09:42:22,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 09:42:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,583 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 09:42:22,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 09:42:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,592 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 09:42:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-28 09:42:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,595 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 09:42:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-28 09:42:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,598 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 09:42:22,599 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 09:42:22,599 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 09:42:22,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-28 09:42:22,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-28 09:42:22,599 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 09:42:22,599 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 09:42:22,600 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 09:42:22,600 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 09:42:22,601 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 09:42:22,601 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 09:42:22,601 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 09:42:22,602 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 09:42:22,602 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 09:42:22,603 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 09:42:22,603 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 09:42:22,603 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 09:42:22,604 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 09:42:22,604 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 09:42:22,604 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 09:42:22,605 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 09:42:22,605 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 09:42:22,606 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 09:42:22,606 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 09:42:22,606 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 09:42:22,607 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 09:42:22,607 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 09:42:22,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,608 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 09:42:22,608 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 09:42:22,608 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 09:42:22,609 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 09:42:22,609 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 09:42:22,609 INFO L290 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,609 INFO L290 TraceCheckUtils]: 37: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,610 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 09:42:22,610 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 09:42:22,610 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 09:42:22,611 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 09:42:22,611 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 09:42:22,611 INFO L290 TraceCheckUtils]: 43: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,612 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 09:42:22,612 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 09:42:22,612 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 09:42:22,613 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 09:42:22,613 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 09:42:22,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,614 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 09:42:22,614 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 09:42:22,614 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 09:42:22,615 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 09:42:22,615 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 09:42:22,615 INFO L290 TraceCheckUtils]: 59: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,615 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,615 INFO L290 TraceCheckUtils]: 61: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,616 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 09:42:22,616 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 09:42:22,616 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 09:42:22,617 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 09:42:22,617 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 09:42:22,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,617 INFO L290 TraceCheckUtils]: 68: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,618 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 09:42:22,618 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 09:42:22,618 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 09:42:22,619 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 09:42:22,619 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 09:42:22,619 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-28 09:42:22,619 INFO L290 TraceCheckUtils]: 76: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-28 09:42:22,619 INFO L290 TraceCheckUtils]: 77: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:22,620 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 09:42:22,620 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 09:42:22,620 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 09:42:22,621 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 09:42:22,621 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 09:42:22,621 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 09:42:22,622 INFO L290 TraceCheckUtils]: 84: Hoare triple {10050#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9998#false} is VALID [2022-04-28 09:42:22,622 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-28 09:42:22,622 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 09:42:22,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:42:22,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377436447] [2022-04-28 09:42:22,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377436447] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:22,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402323556] [2022-04-28 09:42:22,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:42:22,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:42:22,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:42:22,627 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 09:42:22,628 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 09:42:22,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:42:22,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:42:22,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 09:42:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:22,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:42:23,018 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 09:42:29,274 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:42:29,275 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 09:42:29,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2022-04-28 09:42:29,397 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 09:42:29,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-28 09:42:29,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-28 09:42:29,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-28 09:42:29,398 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 09:42:29,398 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 09:42:29,398 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 09:42:29,399 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 09:42:29,399 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 09:42:29,400 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 09:42:29,400 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 09:42:29,401 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 09:42:29,401 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 09:42:29,401 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 09:42:29,402 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 09:42:29,402 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 09:42:29,402 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 09:42:29,403 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 09:42:29,403 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 09:42:29,404 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 09:42:29,404 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 09:42:29,406 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 09:42:29,406 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 09:42:29,407 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 09:42:29,408 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 09:42:29,409 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 09:42:29,410 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 09:42:29,410 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 09:42:29,410 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 09:42:29,411 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 09:42:29,412 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 09:42:29,413 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 09:42:29,413 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 09:42:29,414 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 09:42:29,415 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 09:42:29,415 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 09:42:29,416 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 09:42:29,416 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 09:42:29,417 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 09:42:29,418 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 09:42:29,419 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 09:42:29,420 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 09:42:29,420 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 09:42:29,421 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 09:42:29,421 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 09:42:29,422 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 09:42:29,422 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 09:42:29,423 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 09:42:29,424 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 09:42:29,425 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 09:42:29,425 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 09:42:29,426 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 09:42:29,426 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 09:42:29,427 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 09:42:29,428 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 09:42:29,428 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 09:42:29,429 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 09:42:29,430 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 09:42:29,431 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 09:42:29,431 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 09:42:29,432 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 09:42:29,432 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 09:42:29,433 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 09:42:29,434 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 09:42:29,435 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 09:42:29,436 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 09:42:29,436 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 09:42:29,437 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 09:42:29,437 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 09:42:29,438 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 09:42:29,438 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 09:42:29,439 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 09:42:29,440 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 09:42:29,441 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 09:42:29,442 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 09:42:29,442 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 09:42:29,443 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 09:42:29,444 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 09:42:29,444 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 09:42:29,445 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 09:42:29,446 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 09:42:29,446 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 09:42:29,447 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 09:42:29,447 INFO L290 TraceCheckUtils]: 84: Hoare triple {10325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9998#false} is VALID [2022-04-28 09:42:29,447 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-28 09:42:29,448 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 09:42:29,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:42:29,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402323556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:29,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:42:29,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2022-04-28 09:42:29,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:42:29,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1620424758] [2022-04-28 09:42:29,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1620424758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:42:29,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:42:29,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 09:42:29,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284493676] [2022-04-28 09:42:29,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:42:29,775 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 09:42:29,775 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:42:29,775 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 09:42:29,834 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 09:42:29,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 09:42:29,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:29,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 09:42:29,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 09:42:29,835 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 09:42:32,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:32,763 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-04-28 09:42:32,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 09:42:32,763 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 09:42:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:42:32,764 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 09:42:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-28 09:42:32,766 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 09:42:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-28 09:42:32,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 82 transitions. [2022-04-28 09:42:32,840 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 09:42:32,841 INFO L225 Difference]: With dead ends: 102 [2022-04-28 09:42:32,842 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 09:42:32,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=395, Invalid=4435, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 09:42:32,843 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 09:42:32,843 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.3s Time] [2022-04-28 09:42:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 09:42:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-04-28 09:42:32,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:42:32,888 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 09:42:32,888 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 09:42:32,888 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 09:42:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:32,893 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 09:42:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 09:42:32,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:32,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:32,895 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 09:42:32,895 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 09:42:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:32,896 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 09:42:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 09:42:32,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:32,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:32,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:42:32,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:42:32,897 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 09:42:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-28 09:42:32,899 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2022-04-28 09:42:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:42:32,899 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-28 09:42:32,899 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 09:42:32,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-28 09:42:33,021 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 09:42:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-28 09:42:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 09:42:33,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:42:33,023 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 09:42:33,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 09:42:33,235 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 09:42:33,235 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:42:33,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:42:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 29 times [2022-04-28 09:42:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:33,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [345046079] [2022-04-28 09:42:33,238 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:42:33,238 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:42:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 30 times [2022-04-28 09:42:33,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:42:33,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040449967] [2022-04-28 09:42:33,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:42:33,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:42:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:42:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,432 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 09:42:33,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-28 09:42:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:42:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,435 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 09:42:33,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 09:42:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,438 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 09:42:33,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 09:42:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,441 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 09:42:33,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 09:42:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,444 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 09:42:33,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 09:42:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,447 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 09:42:33,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-28 09:42:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,451 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 09:42:33,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-28 09:42:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,454 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 09:42:33,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:42:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,458 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 09:42:33,458 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 09:42:33,458 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 09:42:33,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-28 09:42:33,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-28 09:42:33,459 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 09:42:33,459 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 09:42:33,459 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 09:42:33,460 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 09:42:33,460 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 09:42:33,461 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 09:42:33,461 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 09:42:33,461 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 09:42:33,462 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 09:42:33,462 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 09:42:33,463 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 09:42:33,463 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 09:42:33,463 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 09:42:33,464 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 09:42:33,464 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 09:42:33,464 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 09:42:33,465 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 09:42:33,465 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 09:42:33,466 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 09:42:33,466 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 09:42:33,466 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 09:42:33,467 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 09:42:33,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,467 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 09:42:33,468 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 09:42:33,468 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 09:42:33,469 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 09:42:33,469 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 09:42:33,469 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,469 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 09:42:33,470 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 09:42:33,470 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 09:42:33,470 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 09:42:33,471 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 09:42:33,471 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,471 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 09:42:33,472 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 09:42:33,472 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 09:42:33,472 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 09:42:33,473 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 09:42:33,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,473 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 09:42:33,474 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 09:42:33,474 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 09:42:33,474 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 09:42:33,474 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 09:42:33,474 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,475 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 09:42:33,475 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 09:42:33,476 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 09:42:33,476 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 09:42:33,476 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 09:42:33,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,477 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,477 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 09:42:33,477 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 09:42:33,478 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 09:42:33,478 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 09:42:33,478 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 09:42:33,478 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,478 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,478 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,479 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 09:42:33,479 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 09:42:33,480 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 09:42:33,480 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 09:42:33,480 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 09:42:33,480 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:33,480 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:33,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:33,481 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 09:42:33,481 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 09:42:33,481 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 09:42:33,482 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 09:42:33,482 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 09:42:33,482 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-28 09:42:33,482 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-28 09:42:33,482 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-28 09:42:33,482 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 09:42:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:42:33,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040449967] [2022-04-28 09:42:33,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040449967] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:33,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915863182] [2022-04-28 09:42:33,483 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:42:33,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:42:33,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:42:33,484 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 09:42:33,485 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 09:42:33,570 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 09:42:33,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:42:33,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 09:42:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:33,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:42:34,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-28 09:42:34,258 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 09:42:34,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-28 09:42:34,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-28 09:42:34,259 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 09:42:34,259 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 09:42:34,259 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 09:42:34,260 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 09:42:34,260 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 09:42:34,260 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 09:42:34,261 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 09:42:34,261 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 09:42:34,261 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 09:42:34,262 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 09:42:34,262 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 09:42:34,262 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 09:42:34,263 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 09:42:34,263 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 09:42:34,263 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 09:42:34,264 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 09:42:34,264 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 09:42:34,264 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 09:42:34,265 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 09:42:34,265 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 09:42:34,266 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 09:42:34,266 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 09:42:34,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,266 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 09:42:34,267 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 09:42:34,267 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 09:42:34,268 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 09:42:34,268 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 09:42:34,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,268 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 09:42:34,269 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 09:42:34,269 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 09:42:34,270 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 09:42:34,270 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 09:42:34,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,271 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 09:42:34,271 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 09:42:34,271 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 09:42:34,272 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 09:42:34,272 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 09:42:34,272 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,272 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 09:42:34,273 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 09:42:34,273 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 09:42:34,274 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 09:42:34,274 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 09:42:34,274 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,275 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 09:42:34,275 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 09:42:34,276 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 09:42:34,276 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 09:42:34,276 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 09:42:34,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,277 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,277 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,277 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 09:42:34,277 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 09:42:34,278 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 09:42:34,278 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 09:42:34,278 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 09:42:34,278 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,279 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,279 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,279 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 09:42:34,279 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 09:42:34,280 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 09:42:34,280 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 09:42:34,280 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 09:42:34,280 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,281 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,281 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,281 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 09:42:34,281 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 09:42:34,282 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 09:42:34,282 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 09:42:34,282 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 09:42:34,282 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-28 09:42:34,283 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-28 09:42:34,283 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-28 09:42:34,283 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 09:42:34,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:42:34,677 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-28 09:42:34,677 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-28 09:42:34,677 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-28 09:42:34,678 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 09:42:34,678 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 09:42:34,679 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 09:42:34,680 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 09:42:34,680 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 09:42:34,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,680 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,681 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,681 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 09:42:34,681 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 09:42:34,681 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 09:42:34,682 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 09:42:34,682 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 09:42:34,682 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,682 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,683 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,683 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 09:42:34,683 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 09:42:34,684 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 09:42:34,684 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 09:42:34,684 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 09:42:34,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,685 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 09:42:34,685 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 09:42:34,686 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 09:42:34,686 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 09:42:34,686 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 09:42:34,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,687 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 09:42:34,687 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 09:42:34,688 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 09:42:34,688 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 09:42:34,688 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 09:42:34,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,689 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,689 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,689 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 09:42:34,689 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 09:42:34,690 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 09:42:34,690 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 09:42:34,691 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 09:42:34,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,691 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 09:42:34,691 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 09:42:34,692 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 09:42:34,692 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 09:42:34,693 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 09:42:34,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,693 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 09:42:34,693 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 09:42:34,694 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 09:42:34,694 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 09:42:34,695 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 09:42:34,695 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-28 09:42:34,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-28 09:42:34,695 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 09:42:34,695 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 09:42:34,696 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 09:42:34,696 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 09:42:34,696 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 09:42:34,697 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 09:42:34,697 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 09:42:34,697 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 09:42:34,698 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 09:42:34,698 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 09:42:34,699 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 09:42:34,699 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 09:42:34,699 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 09:42:34,700 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 09:42:34,700 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 09:42:34,700 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 09:42:34,701 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 09:42:34,701 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 09:42:34,702 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 09:42:34,702 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 09:42:34,702 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 09:42:34,703 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 09:42:34,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-28 09:42:34,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-28 09:42:34,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-28 09:42:34,703 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 09:42:34,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-28 09:42:34,703 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 09:42:34,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915863182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:42:34,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:42:34,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 33 [2022-04-28 09:42:34,704 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:42:34,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [345046079] [2022-04-28 09:42:34,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [345046079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:42:34,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:42:34,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 09:42:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936510537] [2022-04-28 09:42:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:42:34,705 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 09:42:34,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:42:34,705 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 09:42:34,753 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 09:42:34,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 09:42:34,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:34,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 09:42:34,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 09:42:34,754 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 09:42:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:35,585 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2022-04-28 09:42:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 09:42:35,585 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 09:42:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:42:35,586 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 09:42:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-28 09:42:35,587 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 09:42:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-28 09:42:35,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2022-04-28 09:42:35,652 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 09:42:35,653 INFO L225 Difference]: With dead ends: 144 [2022-04-28 09:42:35,653 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 09:42:35,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=490, Invalid=2162, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 09:42:35,654 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 09:42:35,654 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 09:42:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 09:42:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-28 09:42:35,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:42:35,699 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 09:42:35,699 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 09:42:35,699 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 09:42:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:35,701 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 09:42:35,701 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 09:42:35,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:35,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:35,701 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 09:42:35,701 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 09:42:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:42:35,702 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-28 09:42:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-28 09:42:35,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:42:35,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:42:35,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:42:35,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:42:35,703 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 09:42:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-28 09:42:35,704 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-04-28 09:42:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:42:35,705 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-28 09:42:35,705 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 09:42:35,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-28 09:42:35,833 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 09:42:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-28 09:42:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 09:42:35,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:42:35,839 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 09:42:35,856 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 09:42:36,040 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 09:42:36,040 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:42:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:42:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 31 times [2022-04-28 09:42:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:42:36,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [261526983] [2022-04-28 09:42:36,047 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:42:36,047 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:42:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 32 times [2022-04-28 09:42:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:42:36,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741653332] [2022-04-28 09:42:36,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:42:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:42:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:42:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,428 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 09:42:36,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-28 09:42:36,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 09:42:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,433 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 09:42:36,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 09:42:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,436 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 09:42:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 09:42:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,439 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 09:42:36,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 09:42:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,443 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 09:42:36,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:42:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,446 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 09:42:36,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 09:42:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,453 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 09:42:36,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 09:42:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,456 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 09:42:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-28 09:42:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,463 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 09:42:36,463 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 09:42:36,464 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 09:42:36,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-28 09:42:36,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-28 09:42:36,464 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 09:42:36,464 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 09:42:36,465 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 09:42:36,465 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 09:42:36,465 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 09:42:36,466 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 09:42:36,466 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 09:42:36,467 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 09:42:36,467 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 09:42:36,468 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 09:42:36,468 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 09:42:36,469 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 09:42:36,469 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 09:42:36,469 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 09:42:36,470 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 09:42:36,470 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 09:42:36,471 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 09:42:36,471 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 09:42:36,472 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 09:42:36,472 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 09:42:36,473 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 09:42:36,473 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 09:42:36,473 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 09:42:36,474 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 09:42:36,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,474 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 09:42:36,475 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 09:42:36,475 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 09:42:36,476 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 09:42:36,476 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 09:42:36,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,477 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 09:42:36,477 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 09:42:36,478 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 09:42:36,478 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 09:42:36,478 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 09:42:36,478 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,478 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,478 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,479 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 09:42:36,479 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 09:42:36,480 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 09:42:36,480 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 09:42:36,480 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 09:42:36,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,481 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 09:42:36,481 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 09:42:36,482 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 09:42:36,482 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 09:42:36,482 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 09:42:36,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,483 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,483 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 09:42:36,483 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 09:42:36,484 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 09:42:36,484 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 09:42:36,484 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 09:42:36,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,485 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,485 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 09:42:36,485 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 09:42:36,486 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 09:42:36,486 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 09:42:36,486 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 09:42:36,486 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,487 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,487 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,487 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 09:42:36,487 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 09:42:36,488 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 09:42:36,488 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 09:42:36,488 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 09:42:36,489 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:42:36,489 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:42:36,489 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:42:36,489 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 09:42:36,490 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 09:42:36,490 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 09:42:36,491 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 09:42:36,491 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 09:42:36,491 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 09:42:36,492 INFO L290 TraceCheckUtils]: 94: Hoare triple {12413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12355#false} is VALID [2022-04-28 09:42:36,492 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-28 09:42:36,492 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 09:42:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:42:36,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741653332] [2022-04-28 09:42:36,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741653332] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:42:36,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802174880] [2022-04-28 09:42:36,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:42:36,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:42:36,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:42:36,494 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 09:42:36,494 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 09:42:36,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:42:36,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:42:36,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 09:42:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:42:36,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:42:36,742 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 09:44:17,933 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 09:44:17,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-28 09:44:17,996 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 09:44:17,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:17,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-28 09:44:17,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-28 09:44:17,996 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 09:44:17,997 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 09:44:17,997 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 09:44:17,997 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 09:44:17,998 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 09:44:17,998 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 09:44:17,999 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 09:44:17,999 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 09:44:18,000 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 09:44:18,000 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 09:44:18,001 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 09:44:18,001 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 09:44:18,002 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 09:44:18,002 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 09:44:18,002 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 09:44:18,003 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 09:44:18,003 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 09:44:18,004 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 09:44:18,004 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 09:44:18,005 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 09:44:18,005 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 09:44:18,005 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 09:44:18,006 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 09:44:18,007 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 09:44:18,007 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 09:44:18,007 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 09:44:18,008 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 09:44:18,008 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 09:44:18,008 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 09:44:18,009 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 09:44:18,009 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 09:44:18,012 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 09:44:18,012 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 09:44:18,012 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 09:44:18,012 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 09:44:18,014 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 09:44:18,014 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 09:44:18,015 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 09:44:18,016 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 09:44:18,017 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 09:44:18,017 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 09:44:18,018 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 09:44:18,018 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 09:44:18,019 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 09:44:18,019 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 09:44:18,020 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 09:44:18,020 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 09:44:18,021 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 09:44:18,021 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 09:44:18,022 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 09:44:18,022 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 09:44:18,023 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 09:44:18,023 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 09:44:18,024 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 09:44:18,024 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 09:44:18,025 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 09:44:18,025 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 09:44:18,025 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 09:44:18,026 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 09:44:18,026 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 09:44:18,027 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 09:44:18,027 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 09:44:18,028 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 09:44:18,029 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 09:44:18,029 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 09:44:18,029 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 09:44:18,030 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 09:44:18,030 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 09:44:18,030 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 09:44:18,031 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 09:44:18,031 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 09:44:18,032 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 09:44:18,032 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 09:44:18,033 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 09:44:18,033 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 09:44:18,033 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 09:44:18,034 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 09:44:18,034 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 09:44:18,035 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 09:44:18,035 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 09:44:18,036 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 09:44:18,036 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 09:44:18,036 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 09:44:18,037 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 09:44:18,037 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 09:44:18,038 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 09:44:18,038 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 09:44:18,038 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 09:44:18,039 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 09:44:18,039 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-28 09:44:18,039 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-28 09:44:18,040 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 09:44:18,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:44:20,329 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 09:44:20,332 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 09:44:20,485 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-28 09:44:20,486 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-28 09:44:20,486 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 09:44:20,486 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 09:44:20,487 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 09:44:20,487 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 09:44:20,488 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 09:44:20,488 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 09:44:20,489 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,489 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:44:20,489 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:44:20,489 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 09:44:20,489 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 09:44:20,490 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 09:44:20,490 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 09:44:20,491 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 09:44:20,491 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,491 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:44:20,491 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:44:20,491 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 09:44:20,492 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 09:44:20,492 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 09:44:20,492 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 09:44:20,493 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 09:44:20,493 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,493 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:44:20,493 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:44:20,493 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 09:44:20,494 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 09:44:20,494 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 09:44:20,495 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 09:44:20,495 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 09:44:20,495 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:44:20,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:44:20,496 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 09:44:20,496 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 09:44:20,497 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 09:44:20,497 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 09:44:20,498 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 09:44:20,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:44:20,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:44:20,498 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 09:44:20,498 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 09:44:20,499 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 09:44:20,499 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 09:44:20,500 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 09:44:20,500 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,500 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:44:20,500 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:44:20,500 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 09:44:20,501 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 09:44:20,501 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 09:44:20,501 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 09:44:20,502 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 09:44:20,502 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:44:20,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:44:20,502 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 09:44:20,503 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 09:44:20,503 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 09:44:20,504 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 09:44:20,504 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 09:44:20,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-28 09:44:20,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-28 09:44:20,505 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 09:44:20,505 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 09:44:20,506 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 09:44:20,506 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 09:44:20,506 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 09:44:20,507 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 09:44:20,507 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 09:44:20,508 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 09:44:20,508 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 09:44:20,509 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 09:44:20,509 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 09:44:20,509 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 09:44:20,510 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 09:44:20,510 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 09:44:20,511 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 09:44:20,511 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 09:44:20,512 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 09:44:20,512 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 09:44:20,512 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 09:44:20,513 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 09:44:20,513 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 09:44:20,514 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 09:44:20,514 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 09:44:20,514 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 09:44:20,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-28 09:44:20,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-28 09:44:20,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-28 09:44:20,514 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 09:44:20,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-28 09:44:20,515 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 09:44:20,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802174880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:44:20,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:44:20,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 38 [2022-04-28 09:44:20,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:44:20,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [261526983] [2022-04-28 09:44:20,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [261526983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:44:20,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:44:20,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 09:44:20,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738816209] [2022-04-28 09:44:20,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:44:20,516 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 09:44:20,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:44:20,518 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 09:44:20,569 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 09:44:20,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 09:44:20,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:20,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 09:44:20,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1291, Unknown=9, NotChecked=0, Total=1406 [2022-04-28 09:44:20,573 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 09:44:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:23,525 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-04-28 09:44:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 09:44:23,525 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 09:44:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:44:23,526 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 09:44:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-28 09:44:23,527 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 09:44:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-28 09:44:23,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 89 transitions. [2022-04-28 09:44:23,678 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 09:44:23,695 INFO L225 Difference]: With dead ends: 112 [2022-04-28 09:44:23,695 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 09:44:23,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 178 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 103.0s TimeCoverageRelationStatistics Valid=244, Invalid=3529, Unknown=9, NotChecked=0, Total=3782 [2022-04-28 09:44:23,697 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 09:44:23,697 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 09:44:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 09:44:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2022-04-28 09:44:23,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:44:23,758 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 09:44:23,759 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 09:44:23,759 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 09:44:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:23,762 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-28 09:44:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-28 09:44:23,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:23,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:23,762 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 09:44:23,763 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 09:44:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:23,764 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-28 09:44:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-28 09:44:23,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:23,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:23,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:44:23,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:44:23,765 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 09:44:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-28 09:44:23,767 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2022-04-28 09:44:23,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:44:23,767 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-28 09:44:23,768 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 09:44:23,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-28 09:44:23,929 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 09:44:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-28 09:44:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 09:44:23,930 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:44:23,930 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 09:44:23,953 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 09:44:24,130 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 09:44:24,131 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:44:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:44:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 33 times [2022-04-28 09:44:24,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:24,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [771337799] [2022-04-28 09:44:24,133 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:44:24,133 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:44:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 34 times [2022-04-28 09:44:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:44:24,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024949666] [2022-04-28 09:44:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:44:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:44:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:44:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,367 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 09:44:24,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-28 09:44:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 09:44:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,370 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 09:44:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 09:44:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,374 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 09:44:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 09:44:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,377 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 09:44:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 09:44:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,380 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 09:44:24,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:44:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,383 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 09:44:24,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 09:44:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,386 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 09:44:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 09:44:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,389 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 09:44:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-28 09:44:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,392 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 09:44:24,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-28 09:44:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,395 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 09:44:24,396 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 09:44:24,396 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 09:44:24,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-28 09:44:24,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-28 09:44:24,396 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 09:44:24,396 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 09:44:24,397 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 09:44:24,397 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 09:44:24,397 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 09:44:24,398 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 09:44:24,398 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 09:44:24,399 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 09:44:24,399 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 09:44:24,399 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 09:44:24,399 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 09:44:24,400 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 09:44:24,400 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 09:44:24,401 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 09:44:24,401 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 09:44:24,401 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 09:44:24,402 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 09:44:24,402 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 09:44:24,402 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 09:44:24,403 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 09:44:24,403 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 09:44:24,403 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 09:44:24,404 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 09:44:24,404 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 09:44:24,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,405 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 09:44:24,405 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 09:44:24,405 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 09:44:24,406 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 09:44:24,406 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 09:44:24,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,406 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 09:44:24,407 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 09:44:24,407 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 09:44:24,407 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 09:44:24,407 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 09:44:24,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,408 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 09:44:24,408 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 09:44:24,409 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 09:44:24,409 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 09:44:24,409 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 09:44:24,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,410 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,410 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 09:44:24,410 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 09:44:24,411 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 09:44:24,411 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 09:44:24,411 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 09:44:24,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,411 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,411 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,412 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 09:44:24,412 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 09:44:24,412 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 09:44:24,413 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 09:44:24,413 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 09:44:24,413 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,413 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,413 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 09:44:24,414 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 09:44:24,414 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 09:44:24,414 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 09:44:24,415 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 09:44:24,415 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,415 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,415 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,415 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 09:44:24,416 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 09:44:24,416 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 09:44:24,416 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 09:44:24,416 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 09:44:24,417 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,417 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,417 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,417 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 09:44:24,417 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 09:44:24,418 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 09:44:24,418 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 09:44:24,418 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 09:44:24,418 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:24,418 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:24,418 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:24,419 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 09:44:24,419 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 09:44:24,420 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 09:44:24,420 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 09:44:24,420 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 09:44:24,420 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-28 09:44:24,420 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-28 09:44:24,420 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-28 09:44:24,421 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 09:44:24,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:44:24,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024949666] [2022-04-28 09:44:24,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024949666] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:44:24,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923634738] [2022-04-28 09:44:24,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:44:24,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:44:24,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:44:24,428 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 09:44:24,429 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 09:44:24,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:44:24,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:44:24,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 09:44:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:24,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:44:25,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-28 09:44:25,328 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 09:44:25,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-28 09:44:25,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-28 09:44:25,328 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 09:44:25,328 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 09:44:25,329 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 09:44:25,329 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 09:44:25,329 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 09:44:25,330 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 09:44:25,330 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 09:44:25,331 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 09:44:25,331 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 09:44:25,331 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 09:44:25,332 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 09:44:25,332 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 09:44:25,332 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 09:44:25,333 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 09:44:25,333 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 09:44:25,333 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 09:44:25,334 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 09:44:25,334 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 09:44:25,334 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 09:44:25,335 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 09:44:25,335 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 09:44:25,335 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 09:44:25,336 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 09:44:25,336 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 09:44:25,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,337 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 09:44:25,337 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 09:44:25,338 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 09:44:25,338 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 09:44:25,338 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 09:44:25,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,339 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 09:44:25,339 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 09:44:25,340 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 09:44:25,340 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 09:44:25,340 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 09:44:25,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,340 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,341 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 09:44:25,341 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 09:44:25,341 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 09:44:25,342 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 09:44:25,342 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 09:44:25,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,355 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 09:44:25,356 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 09:44:25,356 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 09:44:25,356 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 09:44:25,357 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 09:44:25,357 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,357 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,357 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,357 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 09:44:25,358 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 09:44:25,358 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 09:44:25,359 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 09:44:25,359 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 09:44:25,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,359 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,359 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 09:44:25,360 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 09:44:25,360 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 09:44:25,361 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 09:44:25,361 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 09:44:25,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,361 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,361 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,361 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 09:44:25,362 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 09:44:25,362 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 09:44:25,363 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 09:44:25,363 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 09:44:25,363 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,363 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,363 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,363 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 09:44:25,364 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 09:44:25,364 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 09:44:25,365 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 09:44:25,365 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 09:44:25,365 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,365 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,365 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,365 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 09:44:25,366 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 09:44:25,366 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 09:44:25,367 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 09:44:25,367 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 09:44:25,367 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-28 09:44:25,367 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-28 09:44:25,367 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-28 09:44:25,367 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 09:44:25,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:44:25,814 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-28 09:44:25,814 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-28 09:44:25,814 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-28 09:44:25,814 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 09:44:25,815 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 09:44:25,815 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 09:44:25,815 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 09:44:25,816 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 09:44:25,816 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,816 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,816 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,816 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 09:44:25,816 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 09:44:25,817 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 09:44:25,817 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 09:44:25,818 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 09:44:25,818 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,818 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,818 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,818 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 09:44:25,818 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 09:44:25,819 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 09:44:25,819 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 09:44:25,819 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 09:44:25,820 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,820 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,820 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 09:44:25,820 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 09:44:25,821 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 09:44:25,821 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 09:44:25,821 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 09:44:25,821 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,822 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 09:44:25,822 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 09:44:25,822 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 09:44:25,823 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 09:44:25,823 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 09:44:25,823 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,824 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 09:44:25,824 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 09:44:25,824 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 09:44:25,824 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 09:44:25,825 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 09:44:25,825 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,825 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,825 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 09:44:25,826 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 09:44:25,826 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 09:44:25,826 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 09:44:25,827 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 09:44:25,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,827 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 09:44:25,827 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 09:44:25,828 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 09:44:25,828 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 09:44:25,829 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 09:44:25,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,829 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 09:44:25,829 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 09:44:25,830 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 09:44:25,830 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 09:44:25,830 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 09:44:25,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-28 09:44:25,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-28 09:44:25,831 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 09:44:25,831 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 09:44:25,832 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 09:44:25,832 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 09:44:25,832 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 09:44:25,833 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 09:44:25,833 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 09:44:25,833 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 09:44:25,834 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 09:44:25,834 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 09:44:25,834 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 09:44:25,835 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 09:44:25,835 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 09:44:25,835 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 09:44:25,836 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 09:44:25,836 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 09:44:25,836 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 09:44:25,837 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 09:44:25,837 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 09:44:25,837 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 09:44:25,838 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 09:44:25,838 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 09:44:25,838 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 09:44:25,839 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 09:44:25,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-28 09:44:25,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-28 09:44:25,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-28 09:44:25,839 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 09:44:25,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-28 09:44:25,839 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 09:44:25,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923634738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:44:25,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:44:25,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 36 [2022-04-28 09:44:25,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:44:25,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [771337799] [2022-04-28 09:44:25,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [771337799] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:44:25,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:44:25,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 09:44:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391201068] [2022-04-28 09:44:25,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:44:25,841 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 09:44:25,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:44:25,841 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 09:44:25,892 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 09:44:25,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 09:44:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 09:44:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 09:44:25,893 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 09:44:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:26,962 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-04-28 09:44:26,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 09:44:26,962 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 09:44:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:44:26,963 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 09:44:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-28 09:44:26,964 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 09:44:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-28 09:44:26,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 99 transitions. [2022-04-28 09:44:27,068 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 09:44:27,070 INFO L225 Difference]: With dead ends: 158 [2022-04-28 09:44:27,070 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 09:44:27,071 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 09:44:27,071 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 09:44:27,071 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 09:44:27,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 09:44:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-28 09:44:27,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:44:27,143 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 09:44:27,144 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 09:44:27,144 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 09:44:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:27,146 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-28 09:44:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-28 09:44:27,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:27,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:27,146 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 09:44:27,147 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 09:44:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:27,148 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-28 09:44:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-28 09:44:27,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:27,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:27,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:44:27,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:44:27,150 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 09:44:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-04-28 09:44:27,151 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-04-28 09:44:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:44:27,151 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-04-28 09:44:27,152 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 09:44:27,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 110 transitions. [2022-04-28 09:44:27,308 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 09:44:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-28 09:44:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-28 09:44:27,309 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:44:27,309 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 09:44:27,326 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 09:44:27,509 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 09:44:27,509 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:44:27,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:44:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 35 times [2022-04-28 09:44:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:27,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [583355600] [2022-04-28 09:44:27,512 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:44:27,512 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:44:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 36 times [2022-04-28 09:44:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:44:27,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403953978] [2022-04-28 09:44:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:44:27,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:44:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:44:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,907 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 09:44:27,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-28 09:44:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 09:44:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,921 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 09:44:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:44:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,932 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 09:44:27,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 09:44:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,936 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 09:44:27,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 09:44:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,939 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 09:44:27,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 09:44:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,941 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 09:44:27,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 09:44:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,944 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 09:44:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-28 09:44:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,947 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 09:44:27,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-28 09:44:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,950 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 09:44:27,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 09:44:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:27,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,953 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 09:44:27,953 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 09:44:27,954 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 09:44:27,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-28 09:44:27,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-28 09:44:27,954 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 09:44:27,954 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 09:44:27,955 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 09:44:27,955 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 09:44:27,955 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 09:44:27,956 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 09:44:27,956 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 09:44:27,956 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 09:44:27,957 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 09:44:27,957 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 09:44:27,958 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 09:44:27,958 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 09:44:27,958 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 09:44:27,959 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 09:44:27,959 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 09:44:27,960 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 09:44:27,960 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 09:44:27,961 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 09:44:27,961 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 09:44:27,962 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 09:44:27,962 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 09:44:27,963 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 09:44:27,963 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 09:44:27,964 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 09:44:27,964 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 09:44:27,964 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 09:44:27,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,965 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 09:44:27,965 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 09:44:27,966 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 09:44:27,966 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 09:44:27,966 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 09:44:27,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,967 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 09:44:27,967 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 09:44:27,968 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 09:44:27,968 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 09:44:27,968 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 09:44:27,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,969 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 09:44:27,969 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 09:44:27,970 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 09:44:27,970 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 09:44:27,970 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 09:44:27,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,970 INFO L290 TraceCheckUtils]: 56: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,971 INFO L290 TraceCheckUtils]: 57: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,971 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 09:44:27,971 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 09:44:27,972 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 09:44:27,972 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 09:44:27,972 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 09:44:27,972 INFO L290 TraceCheckUtils]: 63: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,972 INFO L290 TraceCheckUtils]: 64: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,973 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 09:44:27,973 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 09:44:27,974 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 09:44:27,974 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 09:44:27,974 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 09:44:27,974 INFO L290 TraceCheckUtils]: 71: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,974 INFO L290 TraceCheckUtils]: 72: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,975 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 09:44:27,975 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 09:44:27,976 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 09:44:27,976 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 09:44:27,976 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 09:44:27,976 INFO L290 TraceCheckUtils]: 79: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,976 INFO L290 TraceCheckUtils]: 80: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,977 INFO L290 TraceCheckUtils]: 81: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,977 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 09:44:27,977 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 09:44:27,978 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 09:44:27,978 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 09:44:27,978 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 09:44:27,978 INFO L290 TraceCheckUtils]: 87: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,978 INFO L290 TraceCheckUtils]: 88: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,979 INFO L290 TraceCheckUtils]: 89: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,979 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 09:44:27,979 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 09:44:27,980 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 09:44:27,980 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 09:44:27,980 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 09:44:27,981 INFO L290 TraceCheckUtils]: 95: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-28 09:44:27,981 INFO L290 TraceCheckUtils]: 96: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-28 09:44:27,981 INFO L290 TraceCheckUtils]: 97: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:27,981 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 09:44:27,982 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 09:44:27,982 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 09:44:27,983 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 09:44:27,983 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 09:44:27,983 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 09:44:27,984 INFO L290 TraceCheckUtils]: 104: Hoare triple {15267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15203#false} is VALID [2022-04-28 09:44:27,984 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-28 09:44:27,984 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 09:44:27,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:44:27,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403953978] [2022-04-28 09:44:27,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403953978] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:44:27,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616568014] [2022-04-28 09:44:27,985 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:44:27,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:44:27,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:44:27,986 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 09:44:27,987 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 09:44:28,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-28 09:44:28,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:44:28,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 09:44:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:28,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:44:28,531 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 09:44:36,452 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:44:36,453 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 09:44:36,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {15202#true} call ULTIMATE.init(); {15202#true} is VALID [2022-04-28 09:44:36,554 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 09:44:36,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-28 09:44:36,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-28 09:44:36,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-28 09:44:36,555 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 09:44:36,555 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 09:44:36,556 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 09:44:36,556 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 09:44:36,557 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 09:44:36,557 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 09:44:36,557 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 09:44:36,558 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 09:44:36,558 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 09:44:36,559 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 09:44:36,559 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 09:44:36,567 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 09:44:36,568 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 09:44:36,568 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 09:44:36,569 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 09:44:36,569 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 09:44:36,570 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 09:44:36,570 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 09:44:36,570 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 09:44:36,571 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 09:44:36,571 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 09:44:36,573 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 09:44:36,574 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 09:44:36,575 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 09:44:36,576 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 09:44:36,579 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 09:44:36,580 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 09:44:36,581 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 09:44:36,581 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 09:44:36,582 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 09:44:36,583 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 09:44:36,583 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 09:44:36,584 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 09:44:36,587 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 09:44:36,588 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 09:44:36,589 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 09:44:36,590 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 09:44:36,590 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 09:44:36,591 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 09:44:36,592 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 09:44:36,593 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 09:44:36,597 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 09:44:36,599 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 09:44:36,600 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 09:44:36,606 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 09:44:36,607 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 09:44:36,608 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 09:44:36,609 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 09:44:36,609 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 09:44:36,616 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 09:44:36,617 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 09:44:36,617 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 09:44:36,620 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 09:44:36,621 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 09:44:36,622 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 09:44:36,622 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 09:44:36,623 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 09:44:36,627 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 09:44:36,628 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 09:44:36,631 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 09:44:36,632 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 09:44:36,633 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 09:44:36,633 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 09:44:36,634 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 09:44:36,635 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 09:44:36,638 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 09:44:36,642 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 09:44:36,647 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 09:44:36,654 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 09:44:36,654 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 09:44:36,655 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 09:44:36,656 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 09:44:36,657 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 09:44:36,660 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 09:44:36,663 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 09:44:36,668 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 09:44:36,676 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 09:44:36,677 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 09:44:36,678 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 09:44:36,678 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 09:44:36,679 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 09:44:36,682 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 09:44:36,683 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 09:44:36,684 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 09:44:36,684 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 09:44:36,685 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 09:44:36,686 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 09:44:36,687 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 09:44:36,687 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 09:44:36,694 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 09:44:36,695 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 09:44:36,696 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 09:44:36,697 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 09:44:36,697 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 09:44:36,698 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 09:44:36,699 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 09:44:36,700 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 09:44:36,700 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 09:44:36,701 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 09:44:36,701 INFO L290 TraceCheckUtils]: 104: Hoare triple {15606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15203#false} is VALID [2022-04-28 09:44:36,701 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-28 09:44:36,702 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 09:44:36,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:44:37,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616568014] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:44:37,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:44:37,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-04-28 09:44:37,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:44:37,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [583355600] [2022-04-28 09:44:37,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [583355600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:44:37,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:44:37,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 09:44:37,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550653303] [2022-04-28 09:44:37,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:44:37,053 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 09:44:37,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:44:37,054 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 09:44:37,114 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 09:44:37,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 09:44:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:37,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 09:44:37,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2777, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 09:44:37,116 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 09:44:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:40,923 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2022-04-28 09:44:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 09:44:40,924 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 09:44:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:44:40,924 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 09:44:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-28 09:44:40,925 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 09:44:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-28 09:44:40,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 96 transitions. [2022-04-28 09:44:41,009 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 09:44:41,011 INFO L225 Difference]: With dead ends: 122 [2022-04-28 09:44:41,011 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 09:44:41,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 88 SyntacticMatches, 18 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=511, Invalid=6131, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 09:44:41,012 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 75 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:44:41,013 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.7s Time] [2022-04-28 09:44:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 09:44:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-04-28 09:44:41,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:44:41,076 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 09:44:41,076 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 09:44:41,076 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 09:44:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:41,077 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-28 09:44:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-28 09:44:41,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:41,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:41,078 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 09:44:41,078 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 09:44:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:41,080 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-28 09:44:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-28 09:44:41,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:41,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:41,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:44:41,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:44:41,080 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 09:44:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2022-04-28 09:44:41,082 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2022-04-28 09:44:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:44:41,084 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2022-04-28 09:44:41,084 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 09:44:41,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 118 transitions. [2022-04-28 09:44:41,267 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 09:44:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-28 09:44:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-28 09:44:41,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:44:41,273 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 09:44:41,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-28 09:44:41,474 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 09:44:41,474 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:44:41,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:44:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 37 times [2022-04-28 09:44:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:41,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343438800] [2022-04-28 09:44:41,476 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:44:41,476 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:44:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 38 times [2022-04-28 09:44:41,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:44:41,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208830657] [2022-04-28 09:44:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:44:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:44:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:44:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,715 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 09:44:41,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-28 09:44:41,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-28 09:44:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,725 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 09:44:41,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:44:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,728 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 09:44:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 09:44:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,731 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 09:44:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 09:44:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,734 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 09:44:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 09:44:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,737 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 09:44:41,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 09:44:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,739 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 09:44:41,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-28 09:44:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,742 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 09:44:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-28 09:44:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,745 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 09:44:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 09:44:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,749 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 09:44:41,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-28 09:44:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,752 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 09:44:41,752 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 09:44:41,753 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 09:44:41,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-28 09:44:41,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-28 09:44:41,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 09:44:41,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; {16413#(= main_~i~0 0)} is VALID [2022-04-28 09:44:41,753 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 09:44:41,754 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 09:44:41,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 09:44:41,755 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 09:44:41,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 09:44:41,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 09:44:41,756 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 09:44:41,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 09:44:41,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 09:44:41,757 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 09:44:41,757 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 09:44:41,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 09:44:41,758 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 09:44:41,758 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 09:44:41,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 09:44:41,759 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 09:44:41,759 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 09:44:41,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 09:44:41,760 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 09:44:41,760 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 09:44:41,760 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 09:44:41,761 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 09:44:41,761 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 09:44:41,761 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 09:44:41,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,762 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 09:44:41,762 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 09:44:41,763 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 09:44:41,763 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 09:44:41,763 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 09:44:41,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,764 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 09:44:41,764 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 09:44:41,764 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 09:44:41,765 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 09:44:41,765 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 09:44:41,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,765 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 09:44:41,766 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 09:44:41,766 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 09:44:41,766 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 09:44:41,767 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 09:44:41,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,767 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 09:44:41,768 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 09:44:41,768 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 09:44:41,768 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 09:44:41,769 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 09:44:41,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,769 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 09:44:41,770 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 09:44:41,770 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 09:44:41,770 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 09:44:41,770 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 09:44:41,770 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,771 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,771 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,771 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 09:44:41,771 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 09:44:41,772 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 09:44:41,772 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 09:44:41,772 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 09:44:41,772 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,772 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,772 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,773 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 09:44:41,773 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 09:44:41,774 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 09:44:41,774 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 09:44:41,774 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 09:44:41,774 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,774 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,774 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,775 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 09:44:41,775 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 09:44:41,775 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 09:44:41,776 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 09:44:41,776 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 09:44:41,776 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,776 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,776 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,777 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 09:44:41,777 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 09:44:41,777 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 09:44:41,778 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 09:44:41,778 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 09:44:41,778 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:41,778 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:41,778 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:41,778 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 09:44:41,779 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 09:44:41,779 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 09:44:41,779 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 09:44:41,780 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 09:44:41,780 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-28 09:44:41,780 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-28 09:44:41,780 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-28 09:44:41,780 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 09:44:41,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:44:41,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208830657] [2022-04-28 09:44:41,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208830657] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:44:41,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180359149] [2022-04-28 09:44:41,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:44:41,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:44:41,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:44:41,782 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 09:44:41,783 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 09:44:41,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:44:41,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:44:41,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 09:44:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:41,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:44:42,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-28 09:44:42,660 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 09:44:42,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-28 09:44:42,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-28 09:44:42,661 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 09:44:42,661 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 09:44:42,661 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 09:44:42,662 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 09:44:42,662 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 09:44:42,663 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 09:44:42,663 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 09:44:42,663 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 09:44:42,664 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 09:44:42,664 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 09:44:42,664 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 09:44:42,665 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 09:44:42,666 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 09:44:42,667 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 09:44:42,667 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 09:44:42,667 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 09:44:42,668 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 09:44:42,668 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 09:44:42,668 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 09:44:42,669 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 09:44:42,669 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 09:44:42,669 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 09:44:42,670 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 09:44:42,670 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 09:44:42,671 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 09:44:42,671 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 09:44:42,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,671 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 09:44:42,672 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 09:44:42,672 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 09:44:42,673 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 09:44:42,673 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 09:44:42,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,673 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 09:44:42,674 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 09:44:42,674 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 09:44:42,675 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 09:44:42,675 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 09:44:42,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,676 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 09:44:42,676 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 09:44:42,676 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 09:44:42,677 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 09:44:42,677 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 09:44:42,677 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,677 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,678 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 09:44:42,678 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 09:44:42,678 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 09:44:42,679 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 09:44:42,679 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 09:44:42,679 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,679 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,679 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,680 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 09:44:42,680 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 09:44:42,680 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 09:44:42,681 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 09:44:42,681 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 09:44:42,681 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,681 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,681 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,682 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 09:44:42,682 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 09:44:42,682 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 09:44:42,683 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 09:44:42,683 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 09:44:42,683 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,683 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,683 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,684 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 09:44:42,684 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 09:44:42,684 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 09:44:42,685 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 09:44:42,685 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 09:44:42,685 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,685 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,685 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,686 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 09:44:42,686 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 09:44:42,686 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 09:44:42,687 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 09:44:42,687 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 09:44:42,687 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,687 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,687 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,688 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 09:44:42,688 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 09:44:42,688 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 09:44:42,689 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 09:44:42,689 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 09:44:42,689 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:42,689 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:42,689 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:42,690 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 09:44:42,690 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 09:44:42,691 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 09:44:42,691 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 09:44:42,691 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 09:44:42,691 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-28 09:44:42,691 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-28 09:44:42,692 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-28 09:44:42,692 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 09:44:42,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:44:43,175 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-28 09:44:43,175 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-28 09:44:43,175 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-28 09:44:43,175 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 09:44:43,176 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 09:44:43,176 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 09:44:43,177 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 09:44:43,177 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 09:44:43,177 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,177 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,177 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,178 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 09:44:43,178 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 09:44:43,178 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 09:44:43,179 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 09:44:43,179 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 09:44:43,179 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,179 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,179 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,180 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 09:44:43,180 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 09:44:43,180 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 09:44:43,181 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 09:44:43,181 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 09:44:43,181 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,181 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,181 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,182 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 09:44:43,182 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 09:44:43,182 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 09:44:43,183 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 09:44:43,183 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 09:44:43,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,184 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 09:44:43,184 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 09:44:43,184 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 09:44:43,185 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 09:44:43,185 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 09:44:43,185 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,185 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,186 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 09:44:43,186 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 09:44:43,186 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 09:44:43,187 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 09:44:43,187 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 09:44:43,187 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,187 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,187 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,188 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 09:44:43,188 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 09:44:43,189 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 09:44:43,189 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 09:44:43,189 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 09:44:43,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,190 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 09:44:43,190 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 09:44:43,191 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 09:44:43,191 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 09:44:43,192 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 09:44:43,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,192 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 09:44:43,192 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 09:44:43,193 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 09:44:43,193 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 09:44:43,194 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 09:44:43,194 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,194 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 09:44:43,195 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 09:44:43,195 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 09:44:43,196 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 09:44:43,196 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 09:44:43,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-28 09:44:43,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-28 09:44:43,197 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 09:44:43,197 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 09:44:43,197 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 09:44:43,198 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 09:44:43,198 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 09:44:43,199 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 09:44:43,199 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 09:44:43,199 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 09:44:43,200 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 09:44:43,200 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 09:44:43,201 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 09:44:43,201 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 09:44:43,202 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 09:44:43,202 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 09:44:43,202 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 09:44:43,203 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 09:44:43,203 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 09:44:43,204 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 09:44:43,204 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 09:44:43,204 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 09:44:43,205 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 09:44:43,205 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 09:44:43,205 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 09:44:43,206 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 09:44:43,206 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 09:44:43,206 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 09:44:43,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-28 09:44:43,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-28 09:44:43,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-28 09:44:43,207 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 09:44:43,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-28 09:44:43,207 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 09:44:43,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180359149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:44:43,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:44:43,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 39 [2022-04-28 09:44:43,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:44:43,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343438800] [2022-04-28 09:44:43,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343438800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:44:43,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:44:43,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 09:44:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435671604] [2022-04-28 09:44:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:44:43,209 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 09:44:43,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:44:43,209 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 09:44:43,275 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 09:44:43,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 09:44:43,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:43,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 09:44:43,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 09:44:43,277 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 09:44:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:44,321 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2022-04-28 09:44:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 09:44:44,321 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 09:44:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:44:44,322 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 09:44:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-28 09:44:44,324 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 09:44:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-28 09:44:44,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 106 transitions. [2022-04-28 09:44:44,419 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 09:44:44,420 INFO L225 Difference]: With dead ends: 172 [2022-04-28 09:44:44,421 INFO L226 Difference]: Without dead ends: 120 [2022-04-28 09:44:44,421 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 09:44:44,422 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 09:44:44,422 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 09:44:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-28 09:44:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-28 09:44:44,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:44:44,504 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 09:44:44,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 09:44:44,505 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 09:44:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:44,506 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-28 09:44:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-28 09:44:44,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:44,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:44,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 09:44:44,507 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 09:44:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:44,509 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-28 09:44:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-28 09:44:44,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:44,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:44,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:44:44,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:44:44,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 09:44:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-28 09:44:44,511 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-04-28 09:44:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:44:44,512 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-28 09:44:44,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 09:44:44,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-28 09:44:44,688 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 09:44:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-28 09:44:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 09:44:44,689 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:44:44,689 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 09:44:44,719 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 09:44:44,889 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 09:44:44,889 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:44:44,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:44:44,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 39 times [2022-04-28 09:44:44,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:44,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [5480827] [2022-04-28 09:44:44,892 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:44:44,892 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:44:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 40 times [2022-04-28 09:44:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:44:44,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836174898] [2022-04-28 09:44:44,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:44:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:44:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:44:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,309 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 09:44:45,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-28 09:44:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 09:44:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,316 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 09:44:45,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 09:44:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,329 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 09:44:45,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:44:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,332 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 09:44:45,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 09:44:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,335 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 09:44:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 09:44:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,341 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 09:44:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:44:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,344 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 09:44:45,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-28 09:44:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,347 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 09:44:45,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-28 09:44:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,349 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 09:44:45,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-28 09:44:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,353 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 09:44:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-28 09:44:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,356 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 09:44:45,356 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 09:44:45,356 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 09:44:45,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-28 09:44:45,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-28 09:44:45,356 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 09:44:45,357 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 09:44:45,357 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 09:44:45,357 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 09:44:45,358 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 09:44:45,358 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 09:44:45,359 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 09:44:45,359 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 09:44:45,360 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 09:44:45,360 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 09:44:45,360 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 09:44:45,361 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 09:44:45,361 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 09:44:45,362 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 09:44:45,362 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 09:44:45,362 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 09:44:45,363 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 09:44:45,363 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 09:44:45,363 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 09:44:45,364 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 09:44:45,364 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 09:44:45,365 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 09:44:45,365 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 09:44:45,366 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 09:44:45,366 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 09:44:45,366 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 09:44:45,367 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 09:44:45,367 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 09:44:45,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,367 INFO L290 TraceCheckUtils]: 34: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,368 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 09:44:45,368 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 09:44:45,369 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 09:44:45,369 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 09:44:45,369 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 09:44:45,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,370 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 09:44:45,370 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 09:44:45,371 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 09:44:45,371 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 09:44:45,371 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 09:44:45,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,372 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 09:44:45,372 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 09:44:45,373 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 09:44:45,373 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 09:44:45,373 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 09:44:45,373 INFO L290 TraceCheckUtils]: 57: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,374 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 09:44:45,374 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 09:44:45,375 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 09:44:45,375 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 09:44:45,375 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 09:44:45,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,376 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 09:44:45,376 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 09:44:45,377 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 09:44:45,377 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 09:44:45,377 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 09:44:45,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,378 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 09:44:45,378 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 09:44:45,379 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 09:44:45,379 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 09:44:45,379 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 09:44:45,380 INFO L290 TraceCheckUtils]: 81: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,380 INFO L290 TraceCheckUtils]: 82: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,380 INFO L290 TraceCheckUtils]: 83: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,380 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 09:44:45,381 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 09:44:45,381 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 09:44:45,381 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 09:44:45,382 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 09:44:45,382 INFO L290 TraceCheckUtils]: 89: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,382 INFO L290 TraceCheckUtils]: 90: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,382 INFO L290 TraceCheckUtils]: 91: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,382 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 09:44:45,383 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 09:44:45,383 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 09:44:45,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 09:44:45,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 09:44:45,384 INFO L290 TraceCheckUtils]: 97: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,384 INFO L290 TraceCheckUtils]: 98: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,384 INFO L290 TraceCheckUtils]: 99: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,384 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 09:44:45,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 09:44:45,385 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 09:44:45,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 09:44:45,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 09:44:45,386 INFO L290 TraceCheckUtils]: 105: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-28 09:44:45,386 INFO L290 TraceCheckUtils]: 106: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-28 09:44:45,386 INFO L290 TraceCheckUtils]: 107: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:45,386 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 09:44:45,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 09:44:45,387 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 09:44:45,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 09:44:45,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 09:44:45,388 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 09:44:45,389 INFO L290 TraceCheckUtils]: 114: Hoare triple {18112#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18042#false} is VALID [2022-04-28 09:44:45,389 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-28 09:44:45,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 09:44:45,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:44:45,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836174898] [2022-04-28 09:44:45,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836174898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:44:45,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597808520] [2022-04-28 09:44:45,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:44:45,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:44:45,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:44:45,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 09:44:45,392 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 09:44:45,507 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:44:45,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:44:45,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 09:44:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:44:45,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:44:45,900 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 09:44:54,221 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:44:54,221 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 09:44:54,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {18041#true} call ULTIMATE.init(); {18041#true} is VALID [2022-04-28 09:44:54,332 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 09:44:54,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-28 09:44:54,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-28 09:44:54,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-28 09:44:54,333 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 09:44:54,333 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 09:44:54,333 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 09:44:54,334 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 09:44:54,334 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 09:44:54,335 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 09:44:54,335 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 09:44:54,335 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 09:44:54,336 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 09:44:54,336 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 09:44:54,336 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 09:44:54,337 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 09:44:54,337 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 09:44:54,338 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 09:44:54,338 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 09:44:54,338 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 09:44:54,339 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 09:44:54,339 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 09:44:54,339 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 09:44:54,340 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 09:44:54,340 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 09:44:54,341 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 09:44:54,341 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 09:44:54,343 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 09:44:54,344 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 09:44:54,344 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 09:44:54,345 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 09:44:54,346 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 09:44:54,348 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 09:44:54,349 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 09:44:54,349 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 09:44:54,350 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 09:44:54,351 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 09:44:54,351 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 09:44:54,352 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 09:44:54,353 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 09:44:54,357 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 09:44:54,358 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 09:44:54,360 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 09:44:54,361 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 09:44:54,361 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 09:44:54,362 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 09:44:54,363 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 09:44:54,364 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 09:44:54,366 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 09:44:54,370 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 09:44:54,370 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 09:44:54,371 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 09:44:54,371 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 09:44:54,372 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 09:44:54,373 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 09:44:54,374 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 09:44:54,375 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 09:44:54,375 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 09:44:54,376 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 09:44:54,376 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 09:44:54,377 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 09:44:54,378 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 09:44:54,379 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 09:44:54,380 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 09:44:54,382 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 09:44:54,383 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 09:44:54,543 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 09:44:54,544 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 09:44:54,544 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 09:44:54,545 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 09:44:54,546 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 09:44:54,547 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 09:44:54,548 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 09:44:54,557 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 09:44:54,558 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 09:44:54,558 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 09:44:54,559 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 09:44:54,560 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 09:44:54,561 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 09:44:54,562 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 09:44:54,565 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 09:44:54,566 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 09:44:54,567 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 09:44:54,567 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 09:44:54,568 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 09:44:54,569 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 09:44:54,569 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 09:44:54,570 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 09:44:54,571 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 09:44:54,575 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 09:44:54,577 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 09:44:54,578 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 09:44:54,578 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 09:44:54,579 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 09:44:54,580 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 09:44:54,581 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 09:44:54,581 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 09:44:54,589 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 09:44:54,591 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 09:44:54,592 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 09:44:54,593 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 09:44:54,593 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 09:44:54,594 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 09:44:54,595 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 09:44:54,601 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 09:44:54,601 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 09:44:54,602 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 09:44:54,602 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 09:44:54,603 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 09:44:54,604 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 09:44:54,604 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 09:44:54,605 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 09:44:54,605 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 09:44:54,606 INFO L290 TraceCheckUtils]: 114: Hoare triple {18483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18042#false} is VALID [2022-04-28 09:44:54,606 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-28 09:44:54,606 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 09:44:54,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:44:55,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597808520] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:44:55,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:44:55,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 58 [2022-04-28 09:44:55,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:44:55,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [5480827] [2022-04-28 09:44:55,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [5480827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:44:55,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:44:55,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 09:44:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590480672] [2022-04-28 09:44:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:44:55,171 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 09:44:55,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:44:55,171 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 09:44:55,235 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 09:44:55,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 09:44:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:55,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 09:44:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3195, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 09:44:55,236 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 09:44:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:59,396 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-04-28 09:44:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 09:44:59,396 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 09:44:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:44:59,397 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 09:44:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-28 09:44:59,398 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 09:44:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-28 09:44:59,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 103 transitions. [2022-04-28 09:44:59,481 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 09:44:59,482 INFO L225 Difference]: With dead ends: 132 [2022-04-28 09:44:59,483 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 09:44:59,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 96 SyntacticMatches, 20 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=575, Invalid=7081, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 09:44:59,484 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 09:44:59,484 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 09:44:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 09:44:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-28 09:44:59,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:44:59,556 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 09:44:59,556 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 09:44:59,556 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 09:44:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:59,558 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-28 09:44:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-28 09:44:59,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:59,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:59,558 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 09:44:59,559 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 09:44:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:44:59,560 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-28 09:44:59,560 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-28 09:44:59,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:44:59,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:44:59,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:44:59,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:44:59,561 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 09:44:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-28 09:44:59,562 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2022-04-28 09:44:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:44:59,562 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-28 09:44:59,562 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 09:44:59,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-28 09:44:59,761 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 09:44:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-28 09:44:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 09:44:59,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:44:59,762 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 09:44:59,782 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 09:44:59,963 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 09:44:59,963 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:44:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:44:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 41 times [2022-04-28 09:44:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:44:59,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [694409005] [2022-04-28 09:44:59,966 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:44:59,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:44:59,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 42 times [2022-04-28 09:44:59,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:44:59,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382640683] [2022-04-28 09:44:59,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:44:59,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:44:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:45:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,233 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 09:45:00,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-28 09:45:00,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-28 09:45:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,237 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 09:45:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 09:45:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,239 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 09:45:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:45:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,242 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 09:45:00,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 09:45:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,244 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 09:45:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 09:45:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,247 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 09:45:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:45:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,249 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 09:45:00,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-28 09:45:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,252 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 09:45:00,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-28 09:45:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,255 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 09:45:00,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-28 09:45:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,258 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 09:45:00,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-28 09:45:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,260 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 09:45:00,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-28 09:45:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,263 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 09:45:00,263 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 09:45:00,263 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 09:45:00,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-28 09:45:00,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-28 09:45:00,264 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 09:45:00,264 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 09:45:00,264 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 09:45:00,264 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 09:45:00,265 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 09:45:00,265 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 09:45:00,265 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 09:45:00,266 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 09:45:00,266 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 09:45:00,266 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 09:45:00,267 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 09:45:00,267 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 09:45:00,267 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 09:45:00,268 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 09:45:00,268 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 09:45:00,268 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 09:45:00,269 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 09:45:00,269 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 09:45:00,269 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 09:45:00,270 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 09:45:00,270 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 09:45:00,270 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 09:45:00,271 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 09:45:00,271 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 09:45:00,271 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 09:45:00,272 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 09:45:00,272 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 09:45:00,272 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 09:45:00,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,272 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,273 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 09:45:00,273 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 09:45:00,273 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 09:45:00,274 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 09:45:00,274 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 09:45:00,274 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,274 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 09:45:00,275 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 09:45:00,275 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 09:45:00,276 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 09:45:00,276 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 09:45:00,276 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,276 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,276 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,276 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 09:45:00,277 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 09:45:00,277 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 09:45:00,277 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 09:45:00,277 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 09:45:00,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,278 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,278 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,278 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 09:45:00,278 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 09:45:00,279 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 09:45:00,279 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 09:45:00,279 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 09:45:00,279 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,279 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,279 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,280 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 09:45:00,280 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 09:45:00,280 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 09:45:00,281 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 09:45:00,281 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 09:45:00,281 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,281 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,281 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,281 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 09:45:00,282 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 09:45:00,282 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 09:45:00,282 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 09:45:00,283 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 09:45:00,283 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,283 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,283 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,283 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 09:45:00,284 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 09:45:00,284 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 09:45:00,284 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 09:45:00,284 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 09:45:00,284 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,284 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,285 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,285 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 09:45:00,285 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 09:45:00,286 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 09:45:00,286 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 09:45:00,286 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 09:45:00,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,286 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,286 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,287 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 09:45:00,287 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 09:45:00,287 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 09:45:00,288 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 09:45:00,288 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 09:45:00,288 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,288 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,288 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,289 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 09:45:00,289 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 09:45:00,289 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 09:45:00,290 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 09:45:00,290 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 09:45:00,290 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:00,290 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:00,290 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:00,290 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 09:45:00,291 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 09:45:00,291 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 09:45:00,291 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 09:45:00,291 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 09:45:00,292 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-28 09:45:00,292 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-28 09:45:00,292 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-28 09:45:00,292 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 09:45:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:45:00,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382640683] [2022-04-28 09:45:00,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382640683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:45:00,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140673174] [2022-04-28 09:45:00,293 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:45:00,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:45:00,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:45:00,294 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 09:45:00,295 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 09:45:00,459 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 09:45:00,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:45:00,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 09:45:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:00,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:45:01,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-28 09:45:01,326 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 09:45:01,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-28 09:45:01,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-28 09:45:01,326 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 09:45:01,326 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 09:45:01,327 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 09:45:01,327 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 09:45:01,328 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 09:45:01,328 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 09:45:01,328 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 09:45:01,329 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 09:45:01,329 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 09:45:01,329 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 09:45:01,330 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 09:45:01,330 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 09:45:01,330 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 09:45:01,331 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 09:45:01,331 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 09:45:01,331 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 09:45:01,332 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 09:45:01,332 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 09:45:01,332 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 09:45:01,333 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 09:45:01,333 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 09:45:01,334 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 09:45:01,334 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 09:45:01,334 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 09:45:01,335 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 09:45:01,335 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 09:45:01,335 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 09:45:01,336 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 09:45:01,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,336 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 09:45:01,337 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 09:45:01,337 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 09:45:01,337 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 09:45:01,338 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 09:45:01,338 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,338 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 09:45:01,339 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 09:45:01,339 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 09:45:01,339 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 09:45:01,340 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 09:45:01,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,340 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 09:45:01,341 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 09:45:01,341 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 09:45:01,341 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 09:45:01,342 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 09:45:01,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,342 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 09:45:01,343 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 09:45:01,343 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 09:45:01,344 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 09:45:01,344 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 09:45:01,344 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,344 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,344 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,344 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 09:45:01,345 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 09:45:01,352 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 09:45:01,352 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 09:45:01,353 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 09:45:01,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,353 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 09:45:01,354 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 09:45:01,354 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 09:45:01,355 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 09:45:01,355 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 09:45:01,355 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,355 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,355 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,355 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 09:45:01,356 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 09:45:01,356 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 09:45:01,357 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 09:45:01,357 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 09:45:01,357 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,357 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,357 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 09:45:01,358 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 09:45:01,358 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 09:45:01,358 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 09:45:01,359 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 09:45:01,359 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,359 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,359 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,359 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 09:45:01,360 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 09:45:01,360 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 09:45:01,360 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 09:45:01,361 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 09:45:01,361 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,361 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,361 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,361 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 09:45:01,362 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 09:45:01,362 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 09:45:01,362 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 09:45:01,363 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 09:45:01,363 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,363 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,363 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,367 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 09:45:01,368 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 09:45:01,368 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 09:45:01,369 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 09:45:01,369 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 09:45:01,369 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-28 09:45:01,369 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-28 09:45:01,369 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-28 09:45:01,370 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 09:45:01,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:45:01,879 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-28 09:45:01,879 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-28 09:45:01,879 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-28 09:45:01,880 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 09:45:01,880 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 09:45:01,880 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 09:45:01,881 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 09:45:01,881 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 09:45:01,881 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,881 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,881 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,882 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 09:45:01,885 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 09:45:01,886 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 09:45:01,886 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 09:45:01,886 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 09:45:01,886 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,887 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,887 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,887 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 09:45:01,887 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 09:45:01,888 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 09:45:01,888 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 09:45:01,888 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 09:45:01,888 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,889 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,889 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 09:45:01,889 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 09:45:01,889 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 09:45:01,901 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 09:45:01,902 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 09:45:01,902 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,902 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,902 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,902 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 09:45:01,902 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 09:45:01,903 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 09:45:01,903 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 09:45:01,904 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 09:45:01,904 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,904 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,904 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,904 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 09:45:01,904 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 09:45:01,905 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 09:45:01,905 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 09:45:01,906 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 09:45:01,906 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,906 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 09:45:01,907 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 09:45:01,907 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 09:45:01,907 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 09:45:01,908 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 09:45:01,908 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,908 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,908 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,908 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 09:45:01,908 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 09:45:01,909 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 09:45:01,909 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 09:45:01,910 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 09:45:01,910 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,910 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 09:45:01,910 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 09:45:01,911 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 09:45:01,911 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 09:45:01,911 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 09:45:01,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,912 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 09:45:01,912 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 09:45:01,913 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 09:45:01,913 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 09:45:01,913 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 09:45:01,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,914 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,914 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 09:45:01,914 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 09:45:01,914 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 09:45:01,915 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 09:45:01,915 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 09:45:01,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-28 09:45:01,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-28 09:45:01,916 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 09:45:01,916 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 09:45:01,916 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 09:45:01,916 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 09:45:01,917 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 09:45:01,917 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 09:45:01,918 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 09:45:01,918 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 09:45:01,918 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 09:45:01,918 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 09:45:01,919 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 09:45:01,919 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 09:45:01,920 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 09:45:01,920 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 09:45:01,920 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 09:45:01,920 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 09:45:01,921 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 09:45:01,921 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 09:45:01,921 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 09:45:01,922 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 09:45:01,922 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 09:45:01,922 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 09:45:01,923 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 09:45:01,923 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 09:45:01,924 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 09:45:01,924 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 09:45:01,924 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 09:45:01,924 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 09:45:01,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-28 09:45:01,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-28 09:45:01,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-28 09:45:01,925 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 09:45:01,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-28 09:45:01,925 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 09:45:01,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140673174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:45:01,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:45:01,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 42 [2022-04-28 09:45:01,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:45:01,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [694409005] [2022-04-28 09:45:01,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [694409005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:45:01,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:45:01,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 09:45:01,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900400894] [2022-04-28 09:45:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:45:01,928 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 09:45:01,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:45:01,928 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 09:45:01,985 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 09:45:01,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 09:45:01,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:45:01,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 09:45:01,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 09:45:01,986 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 09:45:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:45:03,102 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2022-04-28 09:45:03,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 09:45:03,102 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 09:45:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:45:03,102 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 09:45:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-28 09:45:03,104 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 09:45:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-28 09:45:03,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 113 transitions. [2022-04-28 09:45:03,185 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 09:45:03,187 INFO L225 Difference]: With dead ends: 186 [2022-04-28 09:45:03,187 INFO L226 Difference]: Without dead ends: 130 [2022-04-28 09:45:03,187 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 09:45:03,188 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 09:45:03,188 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 09:45:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-28 09:45:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-04-28 09:45:03,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:45:03,277 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 09:45:03,277 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 09:45:03,277 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 09:45:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:45:03,278 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-28 09:45:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-28 09:45:03,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:45:03,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:45:03,279 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 09:45:03,279 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 09:45:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:45:03,280 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-28 09:45:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-28 09:45:03,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:45:03,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:45:03,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:45:03,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:45:03,281 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 09:45:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-04-28 09:45:03,282 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2022-04-28 09:45:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:45:03,283 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-04-28 09:45:03,283 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 09:45:03,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 130 transitions. [2022-04-28 09:45:03,472 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 09:45:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-28 09:45:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-28 09:45:03,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:45:03,473 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 09:45:03,489 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 09:45:03,673 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 09:45:03,674 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:45:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:45:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 43 times [2022-04-28 09:45:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:45:03,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1928585081] [2022-04-28 09:45:03,677 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:45:03,677 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:45:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 44 times [2022-04-28 09:45:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:45:03,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087199061] [2022-04-28 09:45:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:45:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:45:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:45:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,141 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 09:45:04,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-28 09:45:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 09:45:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,144 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 09:45:04,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 09:45:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,157 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 09:45:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 09:45:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,160 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 09:45:04,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 09:45:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,163 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 09:45:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-28 09:45:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,167 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 09:45:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-28 09:45:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,170 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 09:45:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:45:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,177 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 09:45:04,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-28 09:45:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,180 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 09:45:04,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-28 09:45:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,183 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 09:45:04,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-28 09:45:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,187 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 09:45:04,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-28 09:45:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,190 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 09:45:04,190 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 09:45:04,190 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 09:45:04,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-28 09:45:04,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-28 09:45:04,191 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 09:45:04,191 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 09:45:04,191 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 09:45:04,192 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 09:45:04,192 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 09:45:04,193 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 09:45:04,193 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 09:45:04,194 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 09:45:04,194 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 09:45:04,195 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 09:45:04,195 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 09:45:04,195 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 09:45:04,196 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 09:45:04,196 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 09:45:04,197 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 09:45:04,197 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 09:45:04,198 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 09:45:04,198 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 09:45:04,198 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 09:45:04,199 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 09:45:04,199 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 09:45:04,200 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 09:45:04,200 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 09:45:04,200 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 09:45:04,201 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 09:45:04,201 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 09:45:04,202 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 09:45:04,202 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 09:45:04,203 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 09:45:04,203 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 09:45:04,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,204 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 09:45:04,204 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 09:45:04,204 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 09:45:04,205 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 09:45:04,205 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 09:45:04,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,206 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 09:45:04,206 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 09:45:04,207 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 09:45:04,207 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 09:45:04,207 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 09:45:04,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,208 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 09:45:04,208 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 09:45:04,209 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 09:45:04,209 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 09:45:04,209 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 09:45:04,209 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,210 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 09:45:04,210 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 09:45:04,211 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 09:45:04,211 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 09:45:04,211 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 09:45:04,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,212 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,212 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,212 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 09:45:04,212 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 09:45:04,213 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 09:45:04,213 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 09:45:04,213 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 09:45:04,213 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,214 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,214 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 09:45:04,214 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 09:45:04,215 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 09:45:04,215 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 09:45:04,216 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 09:45:04,216 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,216 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,216 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,216 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 09:45:04,217 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 09:45:04,217 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 09:45:04,218 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 09:45:04,218 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 09:45:04,218 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,218 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,218 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,219 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 09:45:04,219 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 09:45:04,219 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 09:45:04,220 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 09:45:04,220 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 09:45:04,220 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,220 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,220 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,221 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 09:45:04,221 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 09:45:04,222 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 09:45:04,222 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 09:45:04,222 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 09:45:04,222 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,222 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,222 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,223 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 09:45:04,223 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 09:45:04,224 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 09:45:04,224 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 09:45:04,224 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 09:45:04,224 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:45:04,224 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:45:04,224 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:45:04,225 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 09:45:04,225 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 09:45:04,226 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 09:45:04,226 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 09:45:04,227 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 09:45:04,227 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 09:45:04,227 INFO L290 TraceCheckUtils]: 124: Hoare triple {21198#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21122#false} is VALID [2022-04-28 09:45:04,227 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-28 09:45:04,228 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 09:45:04,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:45:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087199061] [2022-04-28 09:45:04,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087199061] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:45:04,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465997811] [2022-04-28 09:45:04,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:45:04,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:45:04,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:45:04,229 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 09:45:04,242 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 09:45:04,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:45:04,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:45:04,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 09:45:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:45:04,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:45:04,527 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 09:48:39,455 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 09:48:39,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-28 09:48:39,524 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 09:48:39,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:39,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-28 09:48:39,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-28 09:48:39,525 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 09:48:39,525 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 09:48:39,526 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 09:48:39,526 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 09:48:39,526 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 09:48:39,527 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 09:48:39,527 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 09:48:39,528 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 09:48:39,528 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 09:48:39,529 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 09:48:39,529 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 09:48:39,530 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 09:48:39,530 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 09:48:39,530 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 09:48:39,531 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 09:48:39,531 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 09:48:39,532 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 09:48:39,532 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 09:48:39,533 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 09:48:39,533 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 09:48:39,534 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 09:48:39,534 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 09:48:39,535 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 09:48:39,535 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 09:48:39,536 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 09:48:39,536 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 09:48:39,536 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 09:48:39,537 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 09:48:39,537 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 09:48:39,538 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 09:48:39,538 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 09:48:39,539 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 09:48:39,539 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 09:48:39,540 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 09:48:39,540 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 09:48:39,540 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 09:48:39,541 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 09:48:39,542 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 09:48:39,542 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 09:48:39,542 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 09:48:39,543 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 09:48:39,543 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 09:48:39,544 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 09:48:39,544 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 09:48:39,545 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 09:48:39,545 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 09:48:39,546 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 09:48:39,546 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 09:48:39,546 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 09:48:39,547 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 09:48:39,547 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 09:48:39,548 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 09:48:39,548 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 09:48:39,549 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 09:48:39,549 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 09:48:39,550 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 09:48:39,550 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 09:48:39,550 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 09:48:39,551 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 09:48:39,551 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 09:48:39,552 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 09:48:39,553 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 09:48:39,553 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 09:48:39,553 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 09:48:39,554 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 09:48:39,554 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 09:48:39,555 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 09:48:39,555 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 09:48:39,556 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 09:48:39,556 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 09:48:39,557 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 09:48:39,557 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 09:48:39,557 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 09:48:39,558 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 09:48:39,558 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 09:48:39,559 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 09:48:39,559 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 09:48:39,560 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 09:48:39,560 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 09:48:39,561 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 09:48:39,561 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 09:48:39,562 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 09:48:39,562 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 09:48:39,562 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 09:48:39,563 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 09:48:39,564 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 09:48:39,564 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 09:48:39,564 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 09:48:39,565 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 09:48:39,565 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 09:48:39,566 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 09:48:39,566 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 09:48:39,566 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 09:48:39,567 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 09:48:39,568 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 09:48:39,568 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 09:48:39,568 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 09:48:39,569 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 09:48:39,569 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 09:48:39,570 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 09:48:39,570 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 09:48:39,571 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 09:48:39,571 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 09:48:39,571 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 09:48:39,572 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 09:48:39,572 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 09:48:39,573 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 09:48:39,573 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 09:48:39,574 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 09:48:39,575 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 09:48:39,575 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 09:48:39,575 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 09:48:39,576 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 09:48:39,576 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 09:48:39,576 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 09:48:39,577 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 09:48:39,577 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 09:48:39,578 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 09:48:39,578 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 09:48:39,579 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-28 09:48:39,579 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-28 09:48:39,579 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 09:48:39,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:48:41,940 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 09:48:41,944 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 09:48:42,111 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-28 09:48:42,112 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-28 09:48:42,112 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 09:48:42,113 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 09:48:42,113 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 09:48:42,114 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 09:48:42,114 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 09:48:42,115 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 09:48:42,115 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,115 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,115 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,115 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 09:48:42,116 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 09:48:42,116 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 09:48:42,117 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 09:48:42,117 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 09:48:42,118 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,118 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,118 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,118 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 09:48:42,118 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 09:48:42,119 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 09:48:42,119 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 09:48:42,120 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 09:48:42,120 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,120 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,120 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,120 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 09:48:42,121 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 09:48:42,121 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 09:48:42,122 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 09:48:42,122 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 09:48:42,123 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,123 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,123 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,123 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 09:48:42,123 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 09:48:42,124 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 09:48:42,124 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 09:48:42,125 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 09:48:42,125 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,125 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,125 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,125 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 09:48:42,126 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 09:48:42,126 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 09:48:42,127 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 09:48:42,127 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 09:48:42,127 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,127 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,127 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,128 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 09:48:42,128 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 09:48:42,128 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 09:48:42,129 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 09:48:42,129 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 09:48:42,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,130 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,130 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,130 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 09:48:42,130 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 09:48:42,131 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 09:48:42,131 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 09:48:42,132 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 09:48:42,132 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,132 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,132 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 09:48:42,132 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 09:48:42,133 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 09:48:42,133 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 09:48:42,134 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 09:48:42,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,134 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 09:48:42,135 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 09:48:42,135 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 09:48:42,136 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 09:48:42,136 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 09:48:42,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,137 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 09:48:42,137 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 09:48:42,138 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 09:48:42,138 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 09:48:42,139 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 09:48:42,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-28 09:48:42,139 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-28 09:48:42,139 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 09:48:42,140 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 09:48:42,140 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 09:48:42,140 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 09:48:42,141 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 09:48:42,141 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 09:48:42,142 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 09:48:42,142 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 09:48:42,143 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 09:48:42,143 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 09:48:42,144 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 09:48:42,144 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 09:48:42,145 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 09:48:42,145 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 09:48:42,145 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 09:48:42,146 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 09:48:42,146 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 09:48:42,147 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 09:48:42,147 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 09:48:42,148 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 09:48:42,148 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 09:48:42,148 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 09:48:42,149 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 09:48:42,149 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 09:48:42,150 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 09:48:42,150 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 09:48:42,150 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 09:48:42,151 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 09:48:42,151 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 09:48:42,151 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 09:48:42,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-28 09:48:42,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-28 09:48:42,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-28 09:48:42,151 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 09:48:42,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-28 09:48:42,152 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 09:48:42,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465997811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:48:42,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:48:42,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 30] total 47 [2022-04-28 09:48:42,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:48:42,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1928585081] [2022-04-28 09:48:42,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1928585081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:48:42,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:48:42,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 09:48:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930425842] [2022-04-28 09:48:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:48:42,154 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 09:48:42,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:48:42,154 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 09:48:42,233 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 09:48:42,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 09:48:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:42,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 09:48:42,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2017, Unknown=12, NotChecked=0, Total=2162 [2022-04-28 09:48:42,234 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 09:48:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:47,710 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-04-28 09:48:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 09:48:47,711 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 09:48:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:48:47,711 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 09:48:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-28 09:48:47,713 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 09:48:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-28 09:48:47,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 110 transitions. [2022-04-28 09:48:47,825 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 09:48:47,827 INFO L225 Difference]: With dead ends: 142 [2022-04-28 09:48:47,827 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 09:48:47,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 235 SyntacticMatches, 26 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 216.7s TimeCoverageRelationStatistics Valid=304, Invalid=5536, Unknown=12, NotChecked=0, Total=5852 [2022-04-28 09:48:47,829 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 09:48:47,829 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.5s Time] [2022-04-28 09:48:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 09:48:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-04-28 09:48:47,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:48:47,946 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 09:48:47,946 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 09:48:47,946 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 09:48:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:47,948 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-28 09:48:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-28 09:48:47,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:47,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:47,949 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 09:48:47,949 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 09:48:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:47,951 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-28 09:48:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-28 09:48:47,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:47,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:47,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:48:47,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:48:47,951 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 09:48:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2022-04-28 09:48:47,953 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2022-04-28 09:48:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:48:47,954 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2022-04-28 09:48:47,954 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 09:48:47,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 138 transitions. [2022-04-28 09:48:48,206 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 09:48:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-28 09:48:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-28 09:48:48,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:48:48,207 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 09:48:48,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 09:48:48,427 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 09:48:48,428 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:48:48,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:48:48,428 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 45 times [2022-04-28 09:48:48,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:48,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256604214] [2022-04-28 09:48:48,432 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:48:48,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:48:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 46 times [2022-04-28 09:48:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:48:48,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576086830] [2022-04-28 09:48:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:48:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:48:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:48:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,778 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 09:48:48,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-28 09:48:48,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 09:48:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,782 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 09:48:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-28 09:48:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,785 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 09:48:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-28 09:48:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,789 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 09:48:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-28 09:48:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,805 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 09:48:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-28 09:48:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,812 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 09:48:48,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-28 09:48:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,816 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 09:48:48,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-28 09:48:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,824 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 09:48:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-28 09:48:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,828 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 09:48:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-28 09:48:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,832 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 09:48:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-28 09:48:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,851 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 09:48:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-28 09:48:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,855 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 09:48:48,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-28 09:48:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:48,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,859 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 09:48:48,860 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 09:48:48,860 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 09:48:48,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-28 09:48:48,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-28 09:48:48,860 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 09:48:48,860 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 09:48:48,861 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 09:48:48,861 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 09:48:48,862 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 09:48:48,862 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 09:48:48,863 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 09:48:48,863 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 09:48:48,863 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 09:48:48,864 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 09:48:48,864 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 09:48:48,865 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 09:48:48,865 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 09:48:48,866 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 09:48:48,866 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 09:48:48,866 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 09:48:48,867 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 09:48:48,867 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 09:48:48,868 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 09:48:48,868 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 09:48:48,868 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 09:48:48,869 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 09:48:48,869 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 09:48:48,870 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 09:48:48,870 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 09:48:48,871 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 09:48:48,871 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 09:48:48,872 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 09:48:48,872 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 09:48:48,872 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 09:48:48,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,873 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 09:48:48,874 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 09:48:48,874 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 09:48:48,874 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 09:48:48,874 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 09:48:48,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,875 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 09:48:48,876 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 09:48:48,876 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 09:48:48,877 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 09:48:48,877 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 09:48:48,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,878 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 09:48:48,878 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 09:48:48,878 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 09:48:48,879 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 09:48:48,879 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 09:48:48,879 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,879 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,880 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 09:48:48,880 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 09:48:48,881 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 09:48:48,881 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 09:48:48,881 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 09:48:48,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,881 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,882 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 09:48:48,882 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 09:48:48,883 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 09:48:48,883 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 09:48:48,883 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 09:48:48,883 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,883 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,883 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,884 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 09:48:48,884 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 09:48:48,884 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 09:48:48,885 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 09:48:48,885 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 09:48:48,885 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,885 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,885 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,886 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 09:48:48,886 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 09:48:48,886 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 09:48:48,887 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 09:48:48,887 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 09:48:48,887 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,887 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,887 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,888 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 09:48:48,888 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 09:48:48,889 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 09:48:48,889 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 09:48:48,889 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 09:48:48,889 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,889 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,889 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,890 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 09:48:48,890 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 09:48:48,891 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 09:48:48,891 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 09:48:48,891 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 09:48:48,891 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,892 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,892 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,892 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 09:48:48,892 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 09:48:48,893 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 09:48:48,893 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 09:48:48,893 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 09:48:48,894 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,894 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,894 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,894 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 09:48:48,895 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 09:48:48,895 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 09:48:48,895 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 09:48:48,896 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 09:48:48,896 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:48,896 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:48,896 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:48,896 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 09:48:48,897 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 09:48:48,897 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 09:48:48,897 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 09:48:48,898 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 09:48:48,898 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-28 09:48:48,898 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-28 09:48:48,898 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-28 09:48:48,899 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 09:48:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:48:48,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576086830] [2022-04-28 09:48:48,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576086830] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:48:48,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876279805] [2022-04-28 09:48:48,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:48:48,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:48:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:48:48,915 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 09:48:48,916 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 09:48:49,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:48:49,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:48:49,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 09:48:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:49,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:48:50,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-28 09:48:50,321 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 09:48:50,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-28 09:48:50,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-28 09:48:50,321 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 09:48:50,322 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 09:48:50,322 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 09:48:50,323 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 09:48:50,323 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 09:48:50,323 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 09:48:50,324 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 09:48:50,324 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 09:48:50,324 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 09:48:50,325 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 09:48:50,325 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 09:48:50,326 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 09:48:50,326 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 09:48:50,326 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 09:48:50,327 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 09:48:50,327 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 09:48:50,328 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 09:48:50,328 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 09:48:50,328 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 09:48:50,329 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 09:48:50,329 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 09:48:50,329 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 09:48:50,330 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 09:48:50,330 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 09:48:50,331 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 09:48:50,331 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 09:48:50,331 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 09:48:50,332 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 09:48:50,332 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 09:48:50,332 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 09:48:50,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,333 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,333 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 09:48:50,333 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 09:48:50,334 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 09:48:50,334 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 09:48:50,334 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 09:48:50,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,335 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 09:48:50,335 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 09:48:50,336 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 09:48:50,336 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 09:48:50,336 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 09:48:50,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,337 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 09:48:50,337 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 09:48:50,338 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 09:48:50,338 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 09:48:50,338 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 09:48:50,338 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,339 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 09:48:50,339 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 09:48:50,340 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 09:48:50,340 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 09:48:50,340 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 09:48:50,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,341 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,347 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 09:48:50,348 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 09:48:50,348 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 09:48:50,349 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 09:48:50,349 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 09:48:50,349 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,349 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,349 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,350 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 09:48:50,350 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 09:48:50,350 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 09:48:50,351 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 09:48:50,351 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 09:48:50,351 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,351 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,351 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,352 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 09:48:50,352 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 09:48:50,353 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 09:48:50,353 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 09:48:50,353 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 09:48:50,353 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,353 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,353 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,354 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 09:48:50,354 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 09:48:50,355 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 09:48:50,355 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 09:48:50,355 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 09:48:50,355 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,356 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,356 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,356 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 09:48:50,356 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 09:48:50,357 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 09:48:50,357 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 09:48:50,357 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 09:48:50,358 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,358 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,358 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,358 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 09:48:50,359 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 09:48:50,359 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 09:48:50,359 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 09:48:50,359 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 09:48:50,360 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,360 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,360 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,360 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 09:48:50,361 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 09:48:50,361 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 09:48:50,361 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 09:48:50,362 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 09:48:50,362 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,362 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,362 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,362 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 09:48:50,363 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 09:48:50,363 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 09:48:50,364 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 09:48:50,364 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 09:48:50,364 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-28 09:48:50,364 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-28 09:48:50,364 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-28 09:48:50,365 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 09:48:50,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:48:50,934 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-28 09:48:50,934 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-28 09:48:50,935 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-28 09:48:50,935 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 09:48:50,950 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 09:48:50,950 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 09:48:50,951 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 09:48:50,951 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 09:48:50,951 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,951 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,951 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,952 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 09:48:50,952 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 09:48:50,952 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 09:48:50,953 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 09:48:50,953 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 09:48:50,953 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,953 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,953 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,953 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 09:48:50,954 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 09:48:50,954 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 09:48:50,955 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 09:48:50,955 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 09:48:50,955 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,955 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,955 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,955 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 09:48:50,956 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 09:48:50,956 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 09:48:50,956 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 09:48:50,957 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 09:48:50,957 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,957 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,957 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,957 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 09:48:50,958 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 09:48:50,958 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 09:48:50,958 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 09:48:50,959 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 09:48:50,959 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,959 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,959 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,959 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 09:48:50,961 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 09:48:50,961 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 09:48:50,961 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 09:48:50,962 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 09:48:50,962 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,962 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,962 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,962 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 09:48:50,962 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 09:48:50,963 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 09:48:50,963 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 09:48:50,964 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 09:48:50,964 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,964 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,964 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 09:48:50,969 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 09:48:50,969 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 09:48:50,970 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 09:48:50,970 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 09:48:50,970 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,970 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,971 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 09:48:50,971 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 09:48:50,971 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 09:48:50,972 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 09:48:50,972 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 09:48:50,972 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,972 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,973 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 09:48:50,973 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 09:48:50,973 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 09:48:50,974 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 09:48:50,974 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 09:48:50,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,975 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 09:48:50,975 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 09:48:50,975 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 09:48:50,976 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 09:48:50,976 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 09:48:50,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,976 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 09:48:50,977 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 09:48:50,977 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 09:48:50,978 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 09:48:50,978 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 09:48:50,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-28 09:48:50,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-28 09:48:50,978 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 09:48:50,979 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 09:48:50,979 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 09:48:50,979 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 09:48:50,980 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 09:48:50,980 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 09:48:50,980 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 09:48:50,981 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 09:48:50,981 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 09:48:50,981 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 09:48:50,982 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 09:48:50,982 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 09:48:50,982 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 09:48:50,983 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 09:48:50,983 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 09:48:50,983 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 09:48:50,984 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 09:48:50,984 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 09:48:50,984 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 09:48:50,985 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 09:48:50,985 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 09:48:50,985 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 09:48:50,986 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 09:48:50,986 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 09:48:50,986 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 09:48:50,987 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 09:48:50,987 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 09:48:50,987 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 09:48:50,988 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 09:48:50,988 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 09:48:50,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-28 09:48:50,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-28 09:48:50,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-28 09:48:50,988 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 09:48:50,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-28 09:48:50,989 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 09:48:50,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876279805] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:48:50,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:48:50,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 45 [2022-04-28 09:48:50,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:48:50,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256604214] [2022-04-28 09:48:50,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256604214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:48:50,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:48:50,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 09:48:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896074809] [2022-04-28 09:48:50,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:48:50,990 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 09:48:50,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:48:50,991 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 09:48:51,057 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 09:48:51,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 09:48:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 09:48:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 09:48:51,059 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 09:48:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:52,402 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2022-04-28 09:48:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 09:48:52,402 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 09:48:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:48:52,402 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 09:48:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-28 09:48:52,407 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 09:48:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-28 09:48:52,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 120 transitions. [2022-04-28 09:48:52,492 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 09:48:52,494 INFO L225 Difference]: With dead ends: 200 [2022-04-28 09:48:52,494 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 09:48:52,495 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 09:48:52,496 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 09:48:52,496 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 09:48:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 09:48:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-04-28 09:48:52,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:48:52,586 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 09:48:52,586 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 09:48:52,586 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 09:48:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:52,588 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-28 09:48:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-28 09:48:52,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:52,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:52,589 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 09:48:52,589 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 09:48:52,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:48:52,590 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-28 09:48:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-28 09:48:52,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:48:52,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:48:52,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:48:52,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:48:52,591 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 09:48:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-04-28 09:48:52,592 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2022-04-28 09:48:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:48:52,592 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-04-28 09:48:52,592 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 09:48:52,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 140 transitions. [2022-04-28 09:48:52,817 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 09:48:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-04-28 09:48:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-28 09:48:52,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:48:52,818 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 09:48:52,835 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 09:48:53,018 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 09:48:53,019 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:48:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:48:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 47 times [2022-04-28 09:48:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:48:53,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806332982] [2022-04-28 09:48:53,021 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:48:53,021 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:48:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 48 times [2022-04-28 09:48:53,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:48:53,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575725652] [2022-04-28 09:48:53,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:48:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:48:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:48:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,837 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 09:48:53,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-28 09:48:53,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 09:48:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,841 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 09:48:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 09:48:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,844 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 09:48:53,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 09:48:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,848 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 09:48:53,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:48:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,851 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 09:48:53,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 09:48:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,854 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 09:48:53,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 09:48:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,857 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 09:48:53,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-28 09:48:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,861 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 09:48:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-28 09:48:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,864 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 09:48:53,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 09:48:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,868 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 09:48:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-28 09:48:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,872 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 09:48:53,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-28 09:48:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,876 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 09:48:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-28 09:48:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:53,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,885 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 09:48:53,885 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 09:48:53,885 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 09:48:53,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-28 09:48:53,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-28 09:48:53,886 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 09:48:53,886 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 09:48:53,887 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 09:48:53,887 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 09:48:53,888 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 09:48:53,888 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 09:48:53,889 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 09:48:53,889 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 09:48:53,890 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 09:48:53,890 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 09:48:53,891 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 09:48:53,891 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 09:48:53,892 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 09:48:53,892 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 09:48:53,892 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 09:48:53,893 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 09:48:53,893 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 09:48:53,894 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 09:48:53,894 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 09:48:53,895 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 09:48:53,895 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 09:48:53,896 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 09:48:53,896 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 09:48:53,897 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 09:48:53,897 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 09:48:53,898 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 09:48:53,898 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 09:48:53,899 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 09:48:53,899 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 09:48:53,900 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 09:48:53,900 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 09:48:53,900 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 09:48:53,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,901 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 09:48:53,901 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 09:48:53,902 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 09:48:53,902 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 09:48:53,902 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 09:48:53,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,903 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 09:48:53,904 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 09:48:53,904 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 09:48:53,905 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 09:48:53,905 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 09:48:53,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,906 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 09:48:53,906 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 09:48:53,907 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 09:48:53,907 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 09:48:53,907 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 09:48:53,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,908 INFO L290 TraceCheckUtils]: 63: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,908 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 09:48:53,908 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 09:48:53,909 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 09:48:53,909 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 09:48:53,910 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 09:48:53,910 INFO L290 TraceCheckUtils]: 69: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,910 INFO L290 TraceCheckUtils]: 70: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,910 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 09:48:53,911 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 09:48:53,911 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 09:48:53,912 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 09:48:53,912 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 09:48:53,912 INFO L290 TraceCheckUtils]: 77: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,912 INFO L290 TraceCheckUtils]: 78: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,912 INFO L290 TraceCheckUtils]: 79: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,913 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 09:48:53,913 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 09:48:53,914 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 09:48:53,914 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 09:48:53,914 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 09:48:53,914 INFO L290 TraceCheckUtils]: 85: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,915 INFO L290 TraceCheckUtils]: 86: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,915 INFO L290 TraceCheckUtils]: 87: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,915 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 09:48:53,916 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 09:48:53,916 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 09:48:53,917 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 09:48:53,917 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 09:48:53,917 INFO L290 TraceCheckUtils]: 93: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,917 INFO L290 TraceCheckUtils]: 94: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,917 INFO L290 TraceCheckUtils]: 95: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,918 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 09:48:53,918 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 09:48:53,918 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 09:48:53,919 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 09:48:53,919 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 09:48:53,919 INFO L290 TraceCheckUtils]: 101: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,919 INFO L290 TraceCheckUtils]: 102: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,919 INFO L290 TraceCheckUtils]: 103: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,920 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 09:48:53,920 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 09:48:53,921 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 09:48:53,921 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 09:48:53,921 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 09:48:53,922 INFO L290 TraceCheckUtils]: 109: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,922 INFO L290 TraceCheckUtils]: 110: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,922 INFO L290 TraceCheckUtils]: 111: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,922 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 09:48:53,923 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 09:48:53,923 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 09:48:53,924 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 09:48:53,924 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 09:48:53,924 INFO L290 TraceCheckUtils]: 117: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,924 INFO L290 TraceCheckUtils]: 118: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,924 INFO L290 TraceCheckUtils]: 119: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,925 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 09:48:53,925 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 09:48:53,926 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 09:48:53,926 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 09:48:53,926 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 09:48:53,926 INFO L290 TraceCheckUtils]: 125: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-28 09:48:53,926 INFO L290 TraceCheckUtils]: 126: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-28 09:48:53,927 INFO L290 TraceCheckUtils]: 127: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:48:53,927 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 09:48:53,928 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 09:48:53,928 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 09:48:53,929 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 09:48:53,929 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 09:48:53,929 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 09:48:53,930 INFO L290 TraceCheckUtils]: 134: Hoare triple {24862#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24780#false} is VALID [2022-04-28 09:48:53,930 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-28 09:48:53,931 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 09:48:53,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:48:53,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575725652] [2022-04-28 09:48:53,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575725652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:48:53,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479838754] [2022-04-28 09:48:53,931 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:48:53,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:48:53,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:48:53,935 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 09:48:53,946 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 09:48:54,257 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-28 09:48:54,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:48:54,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 09:48:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:48:54,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:48:54,714 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 09:49:06,215 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:49:06,216 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 09:49:06,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {24779#true} call ULTIMATE.init(); {24779#true} is VALID [2022-04-28 09:49:06,315 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 09:49:06,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-28 09:49:06,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-28 09:49:06,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-28 09:49:06,316 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 09:49:06,316 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 09:49:06,316 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 09:49:06,317 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 09:49:06,317 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 09:49:06,318 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 09:49:06,318 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 09:49:06,318 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 09:49:06,319 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 09:49:06,319 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 09:49:06,319 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 09:49:06,320 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 09:49:06,320 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 09:49:06,320 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 09:49:06,321 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 09:49:06,321 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 09:49:06,321 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 09:49:06,322 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 09:49:06,322 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 09:49:06,322 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 09:49:06,323 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 09:49:06,323 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 09:49:06,323 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 09:49:06,324 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 09:49:06,324 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 09:49:06,324 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 09:49:06,325 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 09:49:06,326 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 09:49:06,327 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 09:49:06,327 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 09:49:06,328 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 09:49:06,330 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 09:49:06,331 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 09:49:06,331 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 09:49:06,331 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 09:49:06,332 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 09:49:06,332 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 09:49:06,333 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 09:49:06,333 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 09:49:06,336 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 09:49:06,336 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 09:49:06,336 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 09:49:06,336 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 09:49:06,337 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 09:49:06,337 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 09:49:06,338 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 09:49:06,339 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 09:49:06,343 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 09:49:06,343 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 09:49:06,344 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 09:49:06,344 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 09:49:06,345 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 09:49:06,345 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 09:49:06,346 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 09:49:06,346 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 09:49:06,349 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 09:49:06,349 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 09:49:06,350 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 09:49:06,350 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 09:49:06,350 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 09:49:06,351 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 09:49:06,351 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 09:49:06,352 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 09:49:06,354 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 09:49:06,355 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 09:49:06,355 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 09:49:06,355 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 09:49:06,356 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 09:49:06,356 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 09:49:06,357 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 09:49:06,357 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 09:49:06,360 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 09:49:06,360 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 09:49:06,361 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 09:49:06,361 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 09:49:06,361 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 09:49:06,362 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 09:49:06,362 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 09:49:06,363 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 09:49:06,365 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 09:49:06,365 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 09:49:06,365 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 09:49:06,366 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 09:49:06,366 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 09:49:06,367 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 09:49:06,367 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 09:49:06,368 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 09:49:06,371 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 09:49:06,371 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 09:49:06,371 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 09:49:06,372 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 09:49:06,372 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 09:49:06,373 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 09:49:06,373 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 09:49:06,374 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 09:49:06,378 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 09:49:06,379 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 09:49:06,379 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 09:49:06,379 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 09:49:06,380 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 09:49:06,380 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 09:49:06,381 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 09:49:06,381 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 09:49:06,384 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 09:49:06,385 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 09:49:06,385 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 09:49:06,385 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 09:49:06,386 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 09:49:06,386 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 09:49:06,387 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 09:49:06,387 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 09:49:06,389 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 09:49:06,389 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 09:49:06,390 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 09:49:06,390 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 09:49:06,391 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 09:49:06,391 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 09:49:06,392 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 09:49:06,392 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 09:49:06,397 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 09:49:06,398 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 09:49:06,398 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 09:49:06,398 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 09:49:06,399 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; {25280#(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 09:49:06,399 INFO L290 TraceCheckUtils]: 129: Hoare triple {25280#(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; {25280#(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 09:49:06,400 INFO L290 TraceCheckUtils]: 130: Hoare triple {25280#(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; {25287#(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 09:49:06,401 INFO L290 TraceCheckUtils]: 131: Hoare triple {25287#(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 09:49:06,401 INFO L272 TraceCheckUtils]: 132: Hoare triple {24860#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {25294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:49:06,401 INFO L290 TraceCheckUtils]: 133: Hoare triple {25294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:49:06,402 INFO L290 TraceCheckUtils]: 134: Hoare triple {25298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24780#false} is VALID [2022-04-28 09:49:06,402 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-28 09:49:06,402 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 09:49:06,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:49:06,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479838754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:49:06,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:49:06,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 67 [2022-04-28 09:49:06,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:49:06,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806332982] [2022-04-28 09:49:06,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806332982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:49:06,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:49:06,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 09:49:06,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029779973] [2022-04-28 09:49:06,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:49:06,708 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 09:49:06,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:49:06,708 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 09:49:06,795 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 09:49:06,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 09:49:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:06,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 09:49:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=4223, Unknown=1, NotChecked=0, Total=4692 [2022-04-28 09:49:06,796 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 09:49:12,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:12,660 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2022-04-28 09:49:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 09:49:12,660 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 09:49:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:49:12,661 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 09:49:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-28 09:49:12,662 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 09:49:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-28 09:49:12,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 117 transitions. [2022-04-28 09:49:12,757 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 09:49:12,759 INFO L225 Difference]: With dead ends: 152 [2022-04-28 09:49:12,760 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 09:49:12,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 112 SyntacticMatches, 23 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3320 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=745, Invalid=9354, Unknown=1, NotChecked=0, Total=10100 [2022-04-28 09:49:12,761 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:49:12,761 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.6s Time] [2022-04-28 09:49:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 09:49:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-04-28 09:49:12,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:49:12,891 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 09:49:12,891 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 09:49:12,891 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 09:49:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:12,892 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-28 09:49:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-28 09:49:12,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:12,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:12,893 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 09:49:12,893 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 09:49:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:12,894 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-28 09:49:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-28 09:49:12,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:12,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:12,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:49:12,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:49:12,896 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 09:49:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-04-28 09:49:12,897 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2022-04-28 09:49:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:49:12,897 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-04-28 09:49:12,898 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 09:49:12,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 148 transitions. [2022-04-28 09:49:13,129 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 09:49:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-04-28 09:49:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-28 09:49:13,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:49:13,130 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 09:49:13,157 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 09:49:13,330 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 09:49:13,331 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:49:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:49:13,331 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 49 times [2022-04-28 09:49:13,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:13,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [65633185] [2022-04-28 09:49:13,334 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:49:13,334 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:49:13,334 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 50 times [2022-04-28 09:49:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:49:13,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058079857] [2022-04-28 09:49:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:49:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:49:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:49:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {26378#(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); {26292#true} is VALID [2022-04-28 09:49:13,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26292#true} {26292#true} #70#return; {26292#true} is VALID [2022-04-28 09:49:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-28 09:49:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} #68#return; {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-28 09:49:13,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-28 09:49:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26317#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:13,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-28 09:49:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26322#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:13,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-28 09:49:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26327#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-28 09:49:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26332#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-28 09:49:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26337#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-28 09:49:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26342#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:13,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-28 09:49:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26347#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:13,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-28 09:49:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26352#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-28 09:49:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26357#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:13,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-28 09:49:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26362#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:13,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-28 09:49:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26367#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-04-28 09:49:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26372#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:13,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {26292#true} call ULTIMATE.init(); {26378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:49:13,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {26378#(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); {26292#true} is VALID [2022-04-28 09:49:13,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26292#true} #70#return; {26292#true} is VALID [2022-04-28 09:49:13,789 INFO L272 TraceCheckUtils]: 4: Hoare triple {26292#true} call #t~ret6 := main(); {26292#true} is VALID [2022-04-28 09:49:13,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {26292#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26292#true} is VALID [2022-04-28 09:49:13,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {26292#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; {26297#(= main_~i~0 0)} is VALID [2022-04-28 09:49:13,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {26297#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26297#(= main_~i~0 0)} is VALID [2022-04-28 09:49:13,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {26297#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:13,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {26298#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:13,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {26298#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:13,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {26299#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:13,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {26299#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:13,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {26300#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:13,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {26300#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:13,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {26301#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:13,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {26301#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:13,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {26302#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:13,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {26302#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:13,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {26303#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:13,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {26303#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:13,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {26304#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:13,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {26304#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:13,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {26305#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:13,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {26305#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:13,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {26306#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:13,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {26306#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:13,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {26307#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:13,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {26307#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:13,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {26308#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:13,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {26308#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:13,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {26309#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26309#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:13,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {26309#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26310#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:13,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {26310#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26311#(<= main_~n~0 13)} is VALID [2022-04-28 09:49:13,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {26311#(<= main_~n~0 13)} ~i~1 := 0; {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-28 09:49:13,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {26312#(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); {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-28 09:49:13,799 INFO L272 TraceCheckUtils]: 36: Hoare triple {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,800 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26292#true} {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} #68#return; {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-28 09:49:13,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} havoc #t~mem5; {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} is VALID [2022-04-28 09:49:13,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {26312#(and (<= main_~n~0 13) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:13,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {26317#(<= 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); {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:13,801 INFO L272 TraceCheckUtils]: 44: Hoare triple {26317#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,801 INFO L290 TraceCheckUtils]: 47: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,801 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26292#true} {26317#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:13,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {26317#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:13,802 INFO L290 TraceCheckUtils]: 50: Hoare triple {26317#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:13,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {26322#(<= 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); {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:13,802 INFO L272 TraceCheckUtils]: 52: Hoare triple {26322#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,802 INFO L290 TraceCheckUtils]: 53: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,802 INFO L290 TraceCheckUtils]: 54: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,803 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26292#true} {26322#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:13,803 INFO L290 TraceCheckUtils]: 57: Hoare triple {26322#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:13,803 INFO L290 TraceCheckUtils]: 58: Hoare triple {26322#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:13,804 INFO L290 TraceCheckUtils]: 59: Hoare triple {26327#(<= 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); {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:13,804 INFO L272 TraceCheckUtils]: 60: Hoare triple {26327#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,804 INFO L290 TraceCheckUtils]: 61: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,804 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26292#true} {26327#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:13,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {26327#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:13,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {26327#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:13,805 INFO L290 TraceCheckUtils]: 67: Hoare triple {26332#(<= 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); {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:13,806 INFO L272 TraceCheckUtils]: 68: Hoare triple {26332#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,806 INFO L290 TraceCheckUtils]: 70: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,806 INFO L290 TraceCheckUtils]: 71: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,806 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26292#true} {26332#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:13,807 INFO L290 TraceCheckUtils]: 73: Hoare triple {26332#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:13,807 INFO L290 TraceCheckUtils]: 74: Hoare triple {26332#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:13,807 INFO L290 TraceCheckUtils]: 75: Hoare triple {26337#(<= 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); {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:13,807 INFO L272 TraceCheckUtils]: 76: Hoare triple {26337#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,807 INFO L290 TraceCheckUtils]: 77: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,807 INFO L290 TraceCheckUtils]: 78: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,808 INFO L290 TraceCheckUtils]: 79: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,808 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26292#true} {26337#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:13,808 INFO L290 TraceCheckUtils]: 81: Hoare triple {26337#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:13,809 INFO L290 TraceCheckUtils]: 82: Hoare triple {26337#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:13,809 INFO L290 TraceCheckUtils]: 83: Hoare triple {26342#(<= 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); {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:13,809 INFO L272 TraceCheckUtils]: 84: Hoare triple {26342#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,809 INFO L290 TraceCheckUtils]: 85: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,809 INFO L290 TraceCheckUtils]: 86: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,810 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26292#true} {26342#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:13,810 INFO L290 TraceCheckUtils]: 89: Hoare triple {26342#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:13,810 INFO L290 TraceCheckUtils]: 90: Hoare triple {26342#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:13,811 INFO L290 TraceCheckUtils]: 91: Hoare triple {26347#(<= 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); {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:13,811 INFO L272 TraceCheckUtils]: 92: Hoare triple {26347#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,811 INFO L290 TraceCheckUtils]: 93: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,811 INFO L290 TraceCheckUtils]: 94: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,811 INFO L290 TraceCheckUtils]: 95: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,811 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26292#true} {26347#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:13,812 INFO L290 TraceCheckUtils]: 97: Hoare triple {26347#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:13,812 INFO L290 TraceCheckUtils]: 98: Hoare triple {26347#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:13,812 INFO L290 TraceCheckUtils]: 99: Hoare triple {26352#(<= 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); {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:13,812 INFO L272 TraceCheckUtils]: 100: Hoare triple {26352#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,812 INFO L290 TraceCheckUtils]: 101: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,813 INFO L290 TraceCheckUtils]: 102: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,813 INFO L290 TraceCheckUtils]: 103: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,813 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26292#true} {26352#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:13,813 INFO L290 TraceCheckUtils]: 105: Hoare triple {26352#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:13,814 INFO L290 TraceCheckUtils]: 106: Hoare triple {26352#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:13,814 INFO L290 TraceCheckUtils]: 107: Hoare triple {26357#(<= 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); {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:13,814 INFO L272 TraceCheckUtils]: 108: Hoare triple {26357#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,814 INFO L290 TraceCheckUtils]: 109: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,814 INFO L290 TraceCheckUtils]: 110: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,814 INFO L290 TraceCheckUtils]: 111: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,815 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26292#true} {26357#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:13,815 INFO L290 TraceCheckUtils]: 113: Hoare triple {26357#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:13,815 INFO L290 TraceCheckUtils]: 114: Hoare triple {26357#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:13,816 INFO L290 TraceCheckUtils]: 115: Hoare triple {26362#(<= 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); {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:13,816 INFO L272 TraceCheckUtils]: 116: Hoare triple {26362#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,816 INFO L290 TraceCheckUtils]: 117: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,816 INFO L290 TraceCheckUtils]: 118: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,816 INFO L290 TraceCheckUtils]: 119: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,816 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26292#true} {26362#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:13,817 INFO L290 TraceCheckUtils]: 121: Hoare triple {26362#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:13,817 INFO L290 TraceCheckUtils]: 122: Hoare triple {26362#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:13,817 INFO L290 TraceCheckUtils]: 123: Hoare triple {26367#(<= 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); {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:13,817 INFO L272 TraceCheckUtils]: 124: Hoare triple {26367#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,818 INFO L290 TraceCheckUtils]: 125: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,818 INFO L290 TraceCheckUtils]: 126: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,818 INFO L290 TraceCheckUtils]: 127: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,818 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26292#true} {26367#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:13,818 INFO L290 TraceCheckUtils]: 129: Hoare triple {26367#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:13,819 INFO L290 TraceCheckUtils]: 130: Hoare triple {26367#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:13,819 INFO L290 TraceCheckUtils]: 131: Hoare triple {26372#(<= 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); {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:13,819 INFO L272 TraceCheckUtils]: 132: Hoare triple {26372#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:13,819 INFO L290 TraceCheckUtils]: 133: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:13,819 INFO L290 TraceCheckUtils]: 134: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:13,819 INFO L290 TraceCheckUtils]: 135: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:13,820 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26292#true} {26372#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:13,820 INFO L290 TraceCheckUtils]: 137: Hoare triple {26372#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:13,820 INFO L290 TraceCheckUtils]: 138: Hoare triple {26372#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26377#(<= main_~n~0 main_~i~1)} is VALID [2022-04-28 09:49:13,821 INFO L290 TraceCheckUtils]: 139: Hoare triple {26377#(<= 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); {26293#false} is VALID [2022-04-28 09:49:13,821 INFO L272 TraceCheckUtils]: 140: Hoare triple {26293#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26293#false} is VALID [2022-04-28 09:49:13,821 INFO L290 TraceCheckUtils]: 141: Hoare triple {26293#false} ~cond := #in~cond; {26293#false} is VALID [2022-04-28 09:49:13,821 INFO L290 TraceCheckUtils]: 142: Hoare triple {26293#false} assume 0 == ~cond; {26293#false} is VALID [2022-04-28 09:49:13,821 INFO L290 TraceCheckUtils]: 143: Hoare triple {26293#false} assume !false; {26293#false} is VALID [2022-04-28 09:49:13,822 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 09:49:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:49:13,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058079857] [2022-04-28 09:49:13,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058079857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:49:13,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606377749] [2022-04-28 09:49:13,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:49:13,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:49:13,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:49:13,833 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 09:49:13,834 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 09:49:13,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:49:13,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:49:13,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 09:49:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:13,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:49:14,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {26292#true} call ULTIMATE.init(); {26292#true} is VALID [2022-04-28 09:49:14,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#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); {26292#true} is VALID [2022-04-28 09:49:14,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26292#true} #70#return; {26292#true} is VALID [2022-04-28 09:49:14,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {26292#true} call #t~ret6 := main(); {26292#true} is VALID [2022-04-28 09:49:14,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {26292#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26292#true} is VALID [2022-04-28 09:49:14,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {26292#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; {26400#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:14,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {26400#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26400#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:14,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {26400#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:14,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {26298#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:14,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {26298#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:14,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {26299#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:14,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {26299#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:14,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {26300#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:14,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {26300#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:14,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {26301#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:14,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {26301#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:14,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {26302#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:14,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {26302#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:14,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {26303#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:14,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {26303#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:14,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {26304#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:14,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {26304#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:14,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {26305#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:14,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {26305#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:14,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {26306#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:14,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {26306#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:14,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {26307#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:14,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {26307#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:14,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {26308#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:14,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {26308#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:14,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {26309#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26309#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:14,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {26309#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26310#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:14,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {26310#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26311#(<= main_~n~0 13)} is VALID [2022-04-28 09:49:14,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {26311#(<= main_~n~0 13)} ~i~1 := 0; {26485#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-28 09:49:14,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {26485#(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); {26485#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-28 09:49:14,955 INFO L272 TraceCheckUtils]: 36: Hoare triple {26485#(and (<= main_~n~0 13) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,956 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26292#true} {26485#(and (<= main_~n~0 13) (<= 0 main_~i~1))} #68#return; {26485#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-28 09:49:14,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {26485#(and (<= main_~n~0 13) (<= 0 main_~i~1))} havoc #t~mem5; {26485#(and (<= main_~n~0 13) (<= 0 main_~i~1))} is VALID [2022-04-28 09:49:14,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {26485#(and (<= main_~n~0 13) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26510#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {26510#(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); {26510#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,957 INFO L272 TraceCheckUtils]: 44: Hoare triple {26510#(and (<= 1 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,972 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26292#true} {26510#(and (<= 1 main_~i~1) (<= main_~n~0 13))} #68#return; {26510#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {26510#(and (<= 1 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26510#(and (<= 1 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {26510#(and (<= 1 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26535#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-28 09:49:14,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {26535#(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); {26535#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-28 09:49:14,973 INFO L272 TraceCheckUtils]: 52: Hoare triple {26535#(and (<= main_~n~0 13) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,973 INFO L290 TraceCheckUtils]: 53: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,974 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26292#true} {26535#(and (<= main_~n~0 13) (<= 2 main_~i~1))} #68#return; {26535#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-28 09:49:14,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {26535#(and (<= main_~n~0 13) (<= 2 main_~i~1))} havoc #t~mem5; {26535#(and (<= main_~n~0 13) (<= 2 main_~i~1))} is VALID [2022-04-28 09:49:14,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {26535#(and (<= main_~n~0 13) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26560#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-28 09:49:14,975 INFO L290 TraceCheckUtils]: 59: Hoare triple {26560#(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); {26560#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-28 09:49:14,976 INFO L272 TraceCheckUtils]: 60: Hoare triple {26560#(and (<= main_~n~0 13) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,976 INFO L290 TraceCheckUtils]: 62: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,976 INFO L290 TraceCheckUtils]: 63: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,976 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26292#true} {26560#(and (<= main_~n~0 13) (<= 3 main_~i~1))} #68#return; {26560#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-28 09:49:14,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {26560#(and (<= main_~n~0 13) (<= 3 main_~i~1))} havoc #t~mem5; {26560#(and (<= main_~n~0 13) (<= 3 main_~i~1))} is VALID [2022-04-28 09:49:14,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {26560#(and (<= main_~n~0 13) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26585#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-28 09:49:14,978 INFO L290 TraceCheckUtils]: 67: Hoare triple {26585#(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); {26585#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-28 09:49:14,978 INFO L272 TraceCheckUtils]: 68: Hoare triple {26585#(and (<= main_~n~0 13) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,978 INFO L290 TraceCheckUtils]: 69: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,978 INFO L290 TraceCheckUtils]: 70: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,978 INFO L290 TraceCheckUtils]: 71: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,979 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26292#true} {26585#(and (<= main_~n~0 13) (<= 4 main_~i~1))} #68#return; {26585#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-28 09:49:14,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {26585#(and (<= main_~n~0 13) (<= 4 main_~i~1))} havoc #t~mem5; {26585#(and (<= main_~n~0 13) (<= 4 main_~i~1))} is VALID [2022-04-28 09:49:14,979 INFO L290 TraceCheckUtils]: 74: Hoare triple {26585#(and (<= main_~n~0 13) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26610#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-28 09:49:14,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {26610#(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); {26610#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-28 09:49:14,980 INFO L272 TraceCheckUtils]: 76: Hoare triple {26610#(and (<= main_~n~0 13) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,980 INFO L290 TraceCheckUtils]: 78: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,980 INFO L290 TraceCheckUtils]: 79: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,981 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26292#true} {26610#(and (<= main_~n~0 13) (<= 5 main_~i~1))} #68#return; {26610#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-28 09:49:14,981 INFO L290 TraceCheckUtils]: 81: Hoare triple {26610#(and (<= main_~n~0 13) (<= 5 main_~i~1))} havoc #t~mem5; {26610#(and (<= main_~n~0 13) (<= 5 main_~i~1))} is VALID [2022-04-28 09:49:14,982 INFO L290 TraceCheckUtils]: 82: Hoare triple {26610#(and (<= main_~n~0 13) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26635#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,982 INFO L290 TraceCheckUtils]: 83: Hoare triple {26635#(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); {26635#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,982 INFO L272 TraceCheckUtils]: 84: Hoare triple {26635#(and (<= 6 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,982 INFO L290 TraceCheckUtils]: 85: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,982 INFO L290 TraceCheckUtils]: 86: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,982 INFO L290 TraceCheckUtils]: 87: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,983 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26292#true} {26635#(and (<= 6 main_~i~1) (<= main_~n~0 13))} #68#return; {26635#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,983 INFO L290 TraceCheckUtils]: 89: Hoare triple {26635#(and (<= 6 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26635#(and (<= 6 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,984 INFO L290 TraceCheckUtils]: 90: Hoare triple {26635#(and (<= 6 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26660#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-28 09:49:14,984 INFO L290 TraceCheckUtils]: 91: Hoare triple {26660#(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); {26660#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-28 09:49:14,984 INFO L272 TraceCheckUtils]: 92: Hoare triple {26660#(and (<= main_~n~0 13) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,984 INFO L290 TraceCheckUtils]: 93: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,984 INFO L290 TraceCheckUtils]: 94: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,984 INFO L290 TraceCheckUtils]: 95: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,985 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26292#true} {26660#(and (<= main_~n~0 13) (<= 7 main_~i~1))} #68#return; {26660#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-28 09:49:14,985 INFO L290 TraceCheckUtils]: 97: Hoare triple {26660#(and (<= main_~n~0 13) (<= 7 main_~i~1))} havoc #t~mem5; {26660#(and (<= main_~n~0 13) (<= 7 main_~i~1))} is VALID [2022-04-28 09:49:14,986 INFO L290 TraceCheckUtils]: 98: Hoare triple {26660#(and (<= main_~n~0 13) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26685#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-28 09:49:14,986 INFO L290 TraceCheckUtils]: 99: Hoare triple {26685#(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); {26685#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-28 09:49:14,986 INFO L272 TraceCheckUtils]: 100: Hoare triple {26685#(and (<= main_~n~0 13) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,986 INFO L290 TraceCheckUtils]: 101: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,986 INFO L290 TraceCheckUtils]: 102: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,986 INFO L290 TraceCheckUtils]: 103: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,987 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26292#true} {26685#(and (<= main_~n~0 13) (<= 8 main_~i~1))} #68#return; {26685#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-28 09:49:14,987 INFO L290 TraceCheckUtils]: 105: Hoare triple {26685#(and (<= main_~n~0 13) (<= 8 main_~i~1))} havoc #t~mem5; {26685#(and (<= main_~n~0 13) (<= 8 main_~i~1))} is VALID [2022-04-28 09:49:14,988 INFO L290 TraceCheckUtils]: 106: Hoare triple {26685#(and (<= main_~n~0 13) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26710#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-28 09:49:14,988 INFO L290 TraceCheckUtils]: 107: Hoare triple {26710#(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); {26710#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-28 09:49:14,988 INFO L272 TraceCheckUtils]: 108: Hoare triple {26710#(and (<= main_~n~0 13) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,988 INFO L290 TraceCheckUtils]: 109: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,988 INFO L290 TraceCheckUtils]: 110: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,988 INFO L290 TraceCheckUtils]: 111: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,989 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26292#true} {26710#(and (<= main_~n~0 13) (<= 9 main_~i~1))} #68#return; {26710#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-28 09:49:14,989 INFO L290 TraceCheckUtils]: 113: Hoare triple {26710#(and (<= main_~n~0 13) (<= 9 main_~i~1))} havoc #t~mem5; {26710#(and (<= main_~n~0 13) (<= 9 main_~i~1))} is VALID [2022-04-28 09:49:14,990 INFO L290 TraceCheckUtils]: 114: Hoare triple {26710#(and (<= main_~n~0 13) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26735#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,990 INFO L290 TraceCheckUtils]: 115: Hoare triple {26735#(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); {26735#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,990 INFO L272 TraceCheckUtils]: 116: Hoare triple {26735#(and (<= 10 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,990 INFO L290 TraceCheckUtils]: 117: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,990 INFO L290 TraceCheckUtils]: 118: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,990 INFO L290 TraceCheckUtils]: 119: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,991 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26292#true} {26735#(and (<= 10 main_~i~1) (<= main_~n~0 13))} #68#return; {26735#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,991 INFO L290 TraceCheckUtils]: 121: Hoare triple {26735#(and (<= 10 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26735#(and (<= 10 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,992 INFO L290 TraceCheckUtils]: 122: Hoare triple {26735#(and (<= 10 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26760#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,992 INFO L290 TraceCheckUtils]: 123: Hoare triple {26760#(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); {26760#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,992 INFO L272 TraceCheckUtils]: 124: Hoare triple {26760#(and (<= 11 main_~i~1) (<= main_~n~0 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,992 INFO L290 TraceCheckUtils]: 125: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,992 INFO L290 TraceCheckUtils]: 126: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,993 INFO L290 TraceCheckUtils]: 127: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,993 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26292#true} {26760#(and (<= 11 main_~i~1) (<= main_~n~0 13))} #68#return; {26760#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,993 INFO L290 TraceCheckUtils]: 129: Hoare triple {26760#(and (<= 11 main_~i~1) (<= main_~n~0 13))} havoc #t~mem5; {26760#(and (<= 11 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,994 INFO L290 TraceCheckUtils]: 130: Hoare triple {26760#(and (<= 11 main_~i~1) (<= main_~n~0 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26785#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-28 09:49:14,994 INFO L290 TraceCheckUtils]: 131: Hoare triple {26785#(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); {26785#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-28 09:49:14,994 INFO L272 TraceCheckUtils]: 132: Hoare triple {26785#(and (<= main_~n~0 13) (<= 12 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:14,994 INFO L290 TraceCheckUtils]: 133: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:14,994 INFO L290 TraceCheckUtils]: 134: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:14,994 INFO L290 TraceCheckUtils]: 135: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:14,995 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26292#true} {26785#(and (<= main_~n~0 13) (<= 12 main_~i~1))} #68#return; {26785#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-28 09:49:14,995 INFO L290 TraceCheckUtils]: 137: Hoare triple {26785#(and (<= main_~n~0 13) (<= 12 main_~i~1))} havoc #t~mem5; {26785#(and (<= main_~n~0 13) (<= 12 main_~i~1))} is VALID [2022-04-28 09:49:14,996 INFO L290 TraceCheckUtils]: 138: Hoare triple {26785#(and (<= main_~n~0 13) (<= 12 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26810#(and (<= 13 main_~i~1) (<= main_~n~0 13))} is VALID [2022-04-28 09:49:14,996 INFO L290 TraceCheckUtils]: 139: Hoare triple {26810#(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); {26293#false} is VALID [2022-04-28 09:49:14,996 INFO L272 TraceCheckUtils]: 140: Hoare triple {26293#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26293#false} is VALID [2022-04-28 09:49:14,996 INFO L290 TraceCheckUtils]: 141: Hoare triple {26293#false} ~cond := #in~cond; {26293#false} is VALID [2022-04-28 09:49:14,996 INFO L290 TraceCheckUtils]: 142: Hoare triple {26293#false} assume 0 == ~cond; {26293#false} is VALID [2022-04-28 09:49:14,996 INFO L290 TraceCheckUtils]: 143: Hoare triple {26293#false} assume !false; {26293#false} is VALID [2022-04-28 09:49:14,997 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 09:49:14,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:49:15,594 INFO L290 TraceCheckUtils]: 143: Hoare triple {26293#false} assume !false; {26293#false} is VALID [2022-04-28 09:49:15,594 INFO L290 TraceCheckUtils]: 142: Hoare triple {26293#false} assume 0 == ~cond; {26293#false} is VALID [2022-04-28 09:49:15,594 INFO L290 TraceCheckUtils]: 141: Hoare triple {26293#false} ~cond := #in~cond; {26293#false} is VALID [2022-04-28 09:49:15,594 INFO L272 TraceCheckUtils]: 140: Hoare triple {26293#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26293#false} is VALID [2022-04-28 09:49:15,594 INFO L290 TraceCheckUtils]: 139: Hoare triple {26377#(<= 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); {26293#false} is VALID [2022-04-28 09:49:15,595 INFO L290 TraceCheckUtils]: 138: Hoare triple {26372#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26377#(<= main_~n~0 main_~i~1)} is VALID [2022-04-28 09:49:15,595 INFO L290 TraceCheckUtils]: 137: Hoare triple {26372#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:15,596 INFO L284 TraceCheckUtils]: 136: Hoare quadruple {26292#true} {26372#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:15,596 INFO L290 TraceCheckUtils]: 135: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,596 INFO L290 TraceCheckUtils]: 134: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,596 INFO L290 TraceCheckUtils]: 133: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,596 INFO L272 TraceCheckUtils]: 132: Hoare triple {26372#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,596 INFO L290 TraceCheckUtils]: 131: Hoare triple {26372#(<= 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); {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:15,597 INFO L290 TraceCheckUtils]: 130: Hoare triple {26367#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26372#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:15,597 INFO L290 TraceCheckUtils]: 129: Hoare triple {26367#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:15,597 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {26292#true} {26367#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:15,598 INFO L290 TraceCheckUtils]: 127: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,598 INFO L290 TraceCheckUtils]: 126: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,598 INFO L290 TraceCheckUtils]: 125: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,598 INFO L272 TraceCheckUtils]: 124: Hoare triple {26367#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,598 INFO L290 TraceCheckUtils]: 123: Hoare triple {26367#(<= 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); {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:15,599 INFO L290 TraceCheckUtils]: 122: Hoare triple {26362#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26367#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:15,599 INFO L290 TraceCheckUtils]: 121: Hoare triple {26362#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:15,599 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {26292#true} {26362#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:15,599 INFO L290 TraceCheckUtils]: 119: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,600 INFO L290 TraceCheckUtils]: 118: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,600 INFO L290 TraceCheckUtils]: 117: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,600 INFO L272 TraceCheckUtils]: 116: Hoare triple {26362#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,600 INFO L290 TraceCheckUtils]: 115: Hoare triple {26362#(<= 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); {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:15,600 INFO L290 TraceCheckUtils]: 114: Hoare triple {26357#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26362#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:15,601 INFO L290 TraceCheckUtils]: 113: Hoare triple {26357#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:15,601 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {26292#true} {26357#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:15,601 INFO L290 TraceCheckUtils]: 111: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,601 INFO L290 TraceCheckUtils]: 110: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,601 INFO L290 TraceCheckUtils]: 109: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,602 INFO L272 TraceCheckUtils]: 108: Hoare triple {26357#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,602 INFO L290 TraceCheckUtils]: 107: Hoare triple {26357#(<= 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); {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:15,602 INFO L290 TraceCheckUtils]: 106: Hoare triple {26352#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26357#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:15,603 INFO L290 TraceCheckUtils]: 105: Hoare triple {26352#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:15,603 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26292#true} {26352#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:15,603 INFO L290 TraceCheckUtils]: 103: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,603 INFO L290 TraceCheckUtils]: 102: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,603 INFO L290 TraceCheckUtils]: 101: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,603 INFO L272 TraceCheckUtils]: 100: Hoare triple {26352#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,604 INFO L290 TraceCheckUtils]: 99: Hoare triple {26352#(<= 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); {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:15,604 INFO L290 TraceCheckUtils]: 98: Hoare triple {26347#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26352#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:15,604 INFO L290 TraceCheckUtils]: 97: Hoare triple {26347#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:15,605 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {26292#true} {26347#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:15,605 INFO L290 TraceCheckUtils]: 95: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,605 INFO L290 TraceCheckUtils]: 94: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,605 INFO L290 TraceCheckUtils]: 93: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,605 INFO L272 TraceCheckUtils]: 92: Hoare triple {26347#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,605 INFO L290 TraceCheckUtils]: 91: Hoare triple {26347#(<= 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); {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:15,606 INFO L290 TraceCheckUtils]: 90: Hoare triple {26342#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26347#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:15,606 INFO L290 TraceCheckUtils]: 89: Hoare triple {26342#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:15,607 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {26292#true} {26342#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:15,607 INFO L290 TraceCheckUtils]: 87: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,607 INFO L290 TraceCheckUtils]: 86: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,607 INFO L290 TraceCheckUtils]: 85: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,607 INFO L272 TraceCheckUtils]: 84: Hoare triple {26342#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,607 INFO L290 TraceCheckUtils]: 83: Hoare triple {26342#(<= 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); {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:15,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {26337#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26342#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:15,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {26337#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:15,615 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {26292#true} {26337#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:15,615 INFO L290 TraceCheckUtils]: 79: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,615 INFO L290 TraceCheckUtils]: 78: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,615 INFO L290 TraceCheckUtils]: 77: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,615 INFO L272 TraceCheckUtils]: 76: Hoare triple {26337#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,616 INFO L290 TraceCheckUtils]: 75: Hoare triple {26337#(<= 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); {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:15,616 INFO L290 TraceCheckUtils]: 74: Hoare triple {26332#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26337#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:15,616 INFO L290 TraceCheckUtils]: 73: Hoare triple {26332#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:15,617 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26292#true} {26332#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:15,617 INFO L290 TraceCheckUtils]: 71: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,617 INFO L290 TraceCheckUtils]: 70: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,617 INFO L290 TraceCheckUtils]: 69: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,617 INFO L272 TraceCheckUtils]: 68: Hoare triple {26332#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,617 INFO L290 TraceCheckUtils]: 67: Hoare triple {26332#(<= 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); {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:15,618 INFO L290 TraceCheckUtils]: 66: Hoare triple {26327#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26332#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:15,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {26327#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:15,619 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {26292#true} {26327#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:15,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,619 INFO L290 TraceCheckUtils]: 62: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,619 INFO L272 TraceCheckUtils]: 60: Hoare triple {26327#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {26327#(<= 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); {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:15,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {26322#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26327#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:15,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {26322#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:15,620 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {26292#true} {26322#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:15,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,621 INFO L290 TraceCheckUtils]: 54: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,621 INFO L272 TraceCheckUtils]: 52: Hoare triple {26322#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,621 INFO L290 TraceCheckUtils]: 51: Hoare triple {26322#(<= 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); {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:15,622 INFO L290 TraceCheckUtils]: 50: Hoare triple {26317#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26322#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:15,622 INFO L290 TraceCheckUtils]: 49: Hoare triple {26317#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:15,622 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {26292#true} {26317#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:15,622 INFO L290 TraceCheckUtils]: 47: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,623 INFO L272 TraceCheckUtils]: 44: Hoare triple {26317#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {26317#(<= 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); {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:15,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {27129#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {26317#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:15,624 INFO L290 TraceCheckUtils]: 41: Hoare triple {27129#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {27129#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:15,624 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {26292#true} {27129#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {27129#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:15,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-28 09:49:15,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-28 09:49:15,625 INFO L272 TraceCheckUtils]: 36: Hoare triple {27129#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {26292#true} is VALID [2022-04-28 09:49:15,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {27129#(<= 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); {27129#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:15,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {26311#(<= main_~n~0 13)} ~i~1 := 0; {27129#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:15,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {26310#(<= main_~i~0 13)} assume !(~i~0 < ~n~0); {26311#(<= main_~n~0 13)} is VALID [2022-04-28 09:49:15,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {26309#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26310#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:15,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {26309#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26309#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:15,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {26308#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26309#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:15,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {26308#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26308#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:15,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {26307#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26308#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:15,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {26307#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26307#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:15,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {26306#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26307#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:15,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {26306#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26306#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:15,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {26305#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26306#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:15,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {26305#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26305#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:15,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {26304#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26305#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:15,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {26304#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26304#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:15,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {26303#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26304#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:15,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {26303#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26303#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:15,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {26302#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26303#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:15,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {26302#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26302#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:15,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {26301#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26302#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:15,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {26301#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26301#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:15,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {26300#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26301#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:15,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {26300#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26300#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:15,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {26299#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26300#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:15,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {26299#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26299#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:15,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {26298#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26299#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:15,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {26298#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26298#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:15,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {26400#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26298#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:15,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {26400#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {26400#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:15,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {26292#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; {26400#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:15,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {26292#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {26292#true} is VALID [2022-04-28 09:49:15,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {26292#true} call #t~ret6 := main(); {26292#true} is VALID [2022-04-28 09:49:15,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26292#true} #70#return; {26292#true} is VALID [2022-04-28 09:49:15,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-28 09:49:15,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#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); {26292#true} is VALID [2022-04-28 09:49:15,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {26292#true} call ULTIMATE.init(); {26292#true} is VALID [2022-04-28 09:49:15,636 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 09:49:15,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606377749] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:49:15,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:49:15,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 48 [2022-04-28 09:49:15,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:49:15,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [65633185] [2022-04-28 09:49:15,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [65633185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:49:15,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:49:15,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 09:49:15,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607357382] [2022-04-28 09:49:15,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:49:15,637 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 09:49:15,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:49:15,637 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 09:49:15,700 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 09:49:15,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 09:49:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:15,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 09:49:15,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=1754, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 09:49:15,701 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 09:49:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:17,127 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-04-28 09:49:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 09:49:17,127 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 09:49:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:49:17,127 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 09:49:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-28 09:49:17,128 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 09:49:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-28 09:49:17,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 127 transitions. [2022-04-28 09:49:17,236 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 09:49:17,238 INFO L225 Difference]: With dead ends: 214 [2022-04-28 09:49:17,238 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 09:49:17,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1030, Invalid=4822, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 09:49:17,240 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 09:49:17,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 76 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 09:49:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 09:49:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-28 09:49:17,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:49:17,393 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 09:49:17,393 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 09:49:17,393 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 09:49:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:17,395 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-28 09:49:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-28 09:49:17,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:17,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:17,395 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 09:49:17,395 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 09:49:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:17,397 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-28 09:49:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-28 09:49:17,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:17,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:17,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:49:17,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:49:17,397 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 09:49:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2022-04-28 09:49:17,400 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2022-04-28 09:49:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:49:17,400 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2022-04-28 09:49:17,400 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 09:49:17,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 150 transitions. [2022-04-28 09:49:17,627 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 09:49:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2022-04-28 09:49:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-28 09:49:17,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:49:17,628 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 09:49:17,644 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 09:49:17,828 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 09:49:17,828 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:49:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:49:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 51 times [2022-04-28 09:49:17,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:17,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1680471676] [2022-04-28 09:49:17,831 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:49:17,831 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:49:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 52 times [2022-04-28 09:49:17,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:49:17,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931874074] [2022-04-28 09:49:17,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:49:17,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:49:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:49:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {28432#(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); {28342#true} is VALID [2022-04-28 09:49:18,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28342#true} {28342#true} #70#return; {28342#true} is VALID [2022-04-28 09:49:18,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:49:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28363#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} #68#return; {28363#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:18,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 09:49:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28368#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {28368#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:18,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 09:49:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28373#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {28373#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 09:49:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28378#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {28378#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 09:49:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {28383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-28 09:49:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28388#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {28388#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-28 09:49:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28393#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {28393#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:18,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 09:49:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {28398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-28 09:49:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28403#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {28403#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:18,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-28 09:49:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28408#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {28408#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-28 09:49:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28413#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {28413#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:18,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-28 09:49:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28418#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {28418#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-28 09:49:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {28423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:18,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {28342#true} call ULTIMATE.init(); {28432#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:49:18,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {28432#(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); {28342#true} is VALID [2022-04-28 09:49:18,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28342#true} #70#return; {28342#true} is VALID [2022-04-28 09:49:18,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {28342#true} call #t~ret6 := main(); {28342#true} is VALID [2022-04-28 09:49:18,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {28342#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28342#true} is VALID [2022-04-28 09:49:18,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {28342#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; {28347#(= main_~i~0 0)} is VALID [2022-04-28 09:49:18,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {28347#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28347#(= main_~i~0 0)} is VALID [2022-04-28 09:49:18,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {28347#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28348#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:49:18,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {28348#(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); {28348#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:49:18,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {28348#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28349#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:49:18,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {28349#(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); {28349#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:49:18,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {28349#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28350#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:49:18,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {28350#(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); {28350#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:49:18,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {28350#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28351#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 09:49:18,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {28351#(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); {28351#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 09:49:18,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {28351#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28352#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 09:49:18,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {28352#(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); {28352#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 09:49:18,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {28352#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28353#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 09:49:18,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {28353#(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); {28353#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 09:49:18,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {28353#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28354#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 09:49:18,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {28354#(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); {28354#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 09:49:18,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {28354#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28355#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 09:49:18,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {28355#(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); {28355#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 09:49:18,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {28355#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28356#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 09:49:18,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {28356#(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); {28356#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 09:49:18,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {28356#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28357#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 09:49:18,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {28357#(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); {28357#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 09:49:18,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {28357#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28358#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 09:49:18,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {28358#(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); {28358#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 09:49:18,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {28358#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28359#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 09:49:18,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {28359#(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); {28359#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 09:49:18,512 INFO L290 TraceCheckUtils]: 32: Hoare triple {28359#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28360#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 09:49:18,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {28360#(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); {28361#(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 09:49:18,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {28361#(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; {28362#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} is VALID [2022-04-28 09:49:18,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {28362#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} assume !(~i~0 < ~n~0); {28362#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} is VALID [2022-04-28 09:49:18,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {28362#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0)} ~i~1 := 0; {28363#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:18,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {28363#(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); {28363#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:18,514 INFO L272 TraceCheckUtils]: 38: Hoare triple {28363#(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)); {28342#true} is VALID [2022-04-28 09:49:18,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,515 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28342#true} {28363#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} #68#return; {28363#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:18,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {28363#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} havoc #t~mem5; {28363#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:18,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {28363#(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; {28368#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:18,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {28368#(= (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); {28368#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:18,516 INFO L272 TraceCheckUtils]: 46: Hoare triple {28368#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,517 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28342#true} {28368#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {28368#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:18,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {28368#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} havoc #t~mem5; {28368#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:18,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {28368#(= (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; {28373#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {28373#(= (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); {28373#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,518 INFO L272 TraceCheckUtils]: 54: Hoare triple {28373#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,518 INFO L290 TraceCheckUtils]: 55: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,519 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {28342#true} {28373#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {28373#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,519 INFO L290 TraceCheckUtils]: 59: Hoare triple {28373#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {28373#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {28373#(= (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; {28378#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {28378#(= (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); {28378#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,520 INFO L272 TraceCheckUtils]: 62: Hoare triple {28378#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,520 INFO L290 TraceCheckUtils]: 63: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,521 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28342#true} {28378#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {28378#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {28378#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {28378#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {28378#(= (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; {28383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:18,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {28383#(= (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); {28383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:18,522 INFO L272 TraceCheckUtils]: 70: Hoare triple {28383#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,522 INFO L290 TraceCheckUtils]: 71: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,522 INFO L290 TraceCheckUtils]: 72: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,522 INFO L290 TraceCheckUtils]: 73: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,523 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28342#true} {28383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {28383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:18,523 INFO L290 TraceCheckUtils]: 75: Hoare triple {28383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {28383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:18,523 INFO L290 TraceCheckUtils]: 76: Hoare triple {28383#(= (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; {28388#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {28388#(= (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); {28388#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,524 INFO L272 TraceCheckUtils]: 78: Hoare triple {28388#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,524 INFO L290 TraceCheckUtils]: 79: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,524 INFO L290 TraceCheckUtils]: 80: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,524 INFO L290 TraceCheckUtils]: 81: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,525 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28342#true} {28388#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {28388#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {28388#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {28388#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,525 INFO L290 TraceCheckUtils]: 84: Hoare triple {28388#(= (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; {28393#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:18,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {28393#(= (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); {28393#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:18,526 INFO L272 TraceCheckUtils]: 86: Hoare triple {28393#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,526 INFO L290 TraceCheckUtils]: 87: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,526 INFO L290 TraceCheckUtils]: 88: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,526 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {28342#true} {28393#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {28393#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:18,527 INFO L290 TraceCheckUtils]: 91: Hoare triple {28393#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {28393#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:18,527 INFO L290 TraceCheckUtils]: 92: Hoare triple {28393#(= (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; {28398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:18,528 INFO L290 TraceCheckUtils]: 93: Hoare triple {28398#(= (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); {28398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:18,528 INFO L272 TraceCheckUtils]: 94: Hoare triple {28398#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,528 INFO L290 TraceCheckUtils]: 95: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,528 INFO L290 TraceCheckUtils]: 96: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,528 INFO L290 TraceCheckUtils]: 97: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,528 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28342#true} {28398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {28398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:18,529 INFO L290 TraceCheckUtils]: 99: Hoare triple {28398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {28398#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:18,529 INFO L290 TraceCheckUtils]: 100: Hoare triple {28398#(= (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; {28403#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:18,529 INFO L290 TraceCheckUtils]: 101: Hoare triple {28403#(= (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); {28403#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:18,530 INFO L272 TraceCheckUtils]: 102: Hoare triple {28403#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,530 INFO L290 TraceCheckUtils]: 103: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,530 INFO L290 TraceCheckUtils]: 104: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,530 INFO L290 TraceCheckUtils]: 105: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,530 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {28342#true} {28403#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {28403#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:18,531 INFO L290 TraceCheckUtils]: 107: Hoare triple {28403#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {28403#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:18,531 INFO L290 TraceCheckUtils]: 108: Hoare triple {28403#(= (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; {28408#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,531 INFO L290 TraceCheckUtils]: 109: Hoare triple {28408#(= (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); {28408#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,531 INFO L272 TraceCheckUtils]: 110: Hoare triple {28408#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,532 INFO L290 TraceCheckUtils]: 111: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,532 INFO L290 TraceCheckUtils]: 112: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,532 INFO L290 TraceCheckUtils]: 113: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,532 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28342#true} {28408#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {28408#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,533 INFO L290 TraceCheckUtils]: 115: Hoare triple {28408#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {28408#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,533 INFO L290 TraceCheckUtils]: 116: Hoare triple {28408#(= (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; {28413#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:18,533 INFO L290 TraceCheckUtils]: 117: Hoare triple {28413#(= (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); {28413#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:18,533 INFO L272 TraceCheckUtils]: 118: Hoare triple {28413#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,534 INFO L290 TraceCheckUtils]: 119: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,534 INFO L290 TraceCheckUtils]: 120: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,534 INFO L290 TraceCheckUtils]: 121: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,534 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28342#true} {28413#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {28413#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:18,534 INFO L290 TraceCheckUtils]: 123: Hoare triple {28413#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {28413#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:18,535 INFO L290 TraceCheckUtils]: 124: Hoare triple {28413#(= (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; {28418#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:18,535 INFO L290 TraceCheckUtils]: 125: Hoare triple {28418#(= 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); {28418#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:18,535 INFO L272 TraceCheckUtils]: 126: Hoare triple {28418#(= 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)); {28342#true} is VALID [2022-04-28 09:49:18,536 INFO L290 TraceCheckUtils]: 127: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,536 INFO L290 TraceCheckUtils]: 128: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,536 INFO L290 TraceCheckUtils]: 129: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,536 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {28342#true} {28418#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {28418#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:18,536 INFO L290 TraceCheckUtils]: 131: Hoare triple {28418#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {28418#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:18,537 INFO L290 TraceCheckUtils]: 132: Hoare triple {28418#(= 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; {28423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:18,537 INFO L290 TraceCheckUtils]: 133: Hoare triple {28423#(= (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); {28423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:18,537 INFO L272 TraceCheckUtils]: 134: Hoare triple {28423#(= (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)); {28342#true} is VALID [2022-04-28 09:49:18,537 INFO L290 TraceCheckUtils]: 135: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-28 09:49:18,538 INFO L290 TraceCheckUtils]: 136: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-28 09:49:18,538 INFO L290 TraceCheckUtils]: 137: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:18,538 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {28342#true} {28423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {28423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:18,538 INFO L290 TraceCheckUtils]: 139: Hoare triple {28423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {28423#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:18,539 INFO L290 TraceCheckUtils]: 140: Hoare triple {28423#(= (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; {28428#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:18,539 INFO L290 TraceCheckUtils]: 141: Hoare triple {28428#(= (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); {28429#(= |main_#t~mem5| 0)} is VALID [2022-04-28 09:49:18,540 INFO L272 TraceCheckUtils]: 142: Hoare triple {28429#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28430#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:49:18,540 INFO L290 TraceCheckUtils]: 143: Hoare triple {28430#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {28431#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:49:18,540 INFO L290 TraceCheckUtils]: 144: Hoare triple {28431#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28343#false} is VALID [2022-04-28 09:49:18,540 INFO L290 TraceCheckUtils]: 145: Hoare triple {28343#false} assume !false; {28343#false} is VALID [2022-04-28 09:49:18,541 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 09:49:18,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:49:18,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931874074] [2022-04-28 09:49:18,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931874074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:49:18,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138864684] [2022-04-28 09:49:18,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:49:18,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:49:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:49:18,542 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 09:49:18,543 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 09:49:18,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:49:18,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:49:18,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 09:49:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:18,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:49:19,490 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 09:49:30,456 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-28 09:49:30,456 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 09:49:30,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {28342#true} call ULTIMATE.init(); {28342#true} is VALID [2022-04-28 09:49:30,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#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); {28342#true} is VALID [2022-04-28 09:49:30,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-28 09:49:30,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28342#true} #70#return; {28342#true} is VALID [2022-04-28 09:49:30,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {28342#true} call #t~ret6 := main(); {28342#true} is VALID [2022-04-28 09:49:30,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {28342#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28342#true} is VALID [2022-04-28 09:49:30,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {28342#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; {28454#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:30,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {28454#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28454#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:30,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {28454#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28461#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:30,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {28461#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28461#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:30,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {28461#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28468#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:30,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {28468#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28468#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:30,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {28468#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28475#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:30,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {28475#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28475#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:30,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {28475#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28482#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:30,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {28482#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28482#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:30,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {28482#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28489#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:30,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {28489#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28489#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:30,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {28489#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28496#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:30,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {28496#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28496#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:30,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {28496#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28503#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:30,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {28503#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28503#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:30,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {28503#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28510#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:30,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {28510#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28510#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:30,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {28510#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28517#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:30,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {28517#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28517#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:30,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {28517#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28524#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:30,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {28524#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28524#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:30,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {28524#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28531#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:30,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {28531#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28531#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:30,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {28531#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28538#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:30,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {28538#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28538#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:30,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {28538#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {28545#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:30,576 INFO L290 TraceCheckUtils]: 33: Hoare triple {28545#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {28549#(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 09:49:30,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {28549#(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; {28553#(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 09:49:30,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {28553#(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); {28557#(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 09:49:30,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {28557#(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; {28561#(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 09:49:30,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {28561#(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); {28561#(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 09:49:30,579 INFO L272 TraceCheckUtils]: 38: Hoare triple {28561#(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)); {28568#(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 09:49:30,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {28568#(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; {28568#(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 09:49:30,580 INFO L290 TraceCheckUtils]: 40: Hoare triple {28568#(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); {28568#(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 09:49:30,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {28568#(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; {28568#(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 09:49:30,581 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {28568#(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)))} {28561#(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; {28561#(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 09:49:30,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {28561#(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; {28561#(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 09:49:30,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {28561#(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; {28587#(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 09:49:30,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {28587#(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); {28587#(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 09:49:30,583 INFO L272 TraceCheckUtils]: 46: Hoare triple {28587#(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)); {28568#(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 09:49:30,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {28568#(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; {28568#(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 09:49:30,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {28568#(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); {28568#(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 09:49:30,584 INFO L290 TraceCheckUtils]: 49: Hoare triple {28568#(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; {28568#(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 09:49:30,584 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {28568#(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)))} {28587#(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; {28587#(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 09:49:30,585 INFO L290 TraceCheckUtils]: 51: Hoare triple {28587#(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; {28587#(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 09:49:30,585 INFO L290 TraceCheckUtils]: 52: Hoare triple {28587#(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; {28612#(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 09:49:30,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {28612#(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); {28612#(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 09:49:30,587 INFO L272 TraceCheckUtils]: 54: Hoare triple {28612#(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)); {28568#(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 09:49:30,587 INFO L290 TraceCheckUtils]: 55: Hoare triple {28568#(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; {28568#(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 09:49:30,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {28568#(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); {28568#(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 09:49:30,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {28568#(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; {28568#(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 09:49:30,588 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {28568#(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)))} {28612#(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; {28612#(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 09:49:30,589 INFO L290 TraceCheckUtils]: 59: Hoare triple {28612#(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; {28612#(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 09:49:30,589 INFO L290 TraceCheckUtils]: 60: Hoare triple {28612#(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; {28637#(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 09:49:30,590 INFO L290 TraceCheckUtils]: 61: Hoare triple {28637#(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); {28637#(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 09:49:30,590 INFO L272 TraceCheckUtils]: 62: Hoare triple {28637#(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)); {28568#(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 09:49:30,591 INFO L290 TraceCheckUtils]: 63: Hoare triple {28568#(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; {28568#(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 09:49:30,591 INFO L290 TraceCheckUtils]: 64: Hoare triple {28568#(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); {28568#(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 09:49:30,591 INFO L290 TraceCheckUtils]: 65: Hoare triple {28568#(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; {28568#(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 09:49:30,592 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {28568#(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)))} {28637#(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; {28637#(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 09:49:30,592 INFO L290 TraceCheckUtils]: 67: Hoare triple {28637#(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; {28637#(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 09:49:30,593 INFO L290 TraceCheckUtils]: 68: Hoare triple {28637#(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; {28662#(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 09:49:30,593 INFO L290 TraceCheckUtils]: 69: Hoare triple {28662#(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); {28662#(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 09:49:30,594 INFO L272 TraceCheckUtils]: 70: Hoare triple {28662#(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)); {28568#(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 09:49:30,594 INFO L290 TraceCheckUtils]: 71: Hoare triple {28568#(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; {28568#(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 09:49:30,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {28568#(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); {28568#(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 09:49:30,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {28568#(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; {28568#(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 09:49:30,596 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {28568#(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)))} {28662#(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; {28662#(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 09:49:30,596 INFO L290 TraceCheckUtils]: 75: Hoare triple {28662#(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; {28662#(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 09:49:30,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {28662#(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; {28687#(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 09:49:30,597 INFO L290 TraceCheckUtils]: 77: Hoare triple {28687#(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); {28687#(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 09:49:30,598 INFO L272 TraceCheckUtils]: 78: Hoare triple {28687#(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)); {28568#(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 09:49:30,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {28568#(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; {28568#(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 09:49:30,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {28568#(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); {28568#(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 09:49:30,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {28568#(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; {28568#(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 09:49:30,599 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {28568#(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)))} {28687#(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; {28687#(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 09:49:30,600 INFO L290 TraceCheckUtils]: 83: Hoare triple {28687#(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; {28687#(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 09:49:30,600 INFO L290 TraceCheckUtils]: 84: Hoare triple {28687#(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; {28712#(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 09:49:30,601 INFO L290 TraceCheckUtils]: 85: Hoare triple {28712#(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); {28712#(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 09:49:30,602 INFO L272 TraceCheckUtils]: 86: Hoare triple {28712#(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)); {28568#(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 09:49:30,602 INFO L290 TraceCheckUtils]: 87: Hoare triple {28568#(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; {28568#(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 09:49:30,602 INFO L290 TraceCheckUtils]: 88: Hoare triple {28568#(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); {28568#(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 09:49:30,603 INFO L290 TraceCheckUtils]: 89: Hoare triple {28568#(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; {28568#(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 09:49:30,603 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {28568#(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)))} {28712#(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; {28712#(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 09:49:30,604 INFO L290 TraceCheckUtils]: 91: Hoare triple {28712#(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; {28712#(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 09:49:30,604 INFO L290 TraceCheckUtils]: 92: Hoare triple {28712#(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; {28737#(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 09:49:30,605 INFO L290 TraceCheckUtils]: 93: Hoare triple {28737#(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); {28737#(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 09:49:30,606 INFO L272 TraceCheckUtils]: 94: Hoare triple {28737#(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)); {28568#(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 09:49:30,606 INFO L290 TraceCheckUtils]: 95: Hoare triple {28568#(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; {28568#(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 09:49:30,606 INFO L290 TraceCheckUtils]: 96: Hoare triple {28568#(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); {28568#(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 09:49:30,606 INFO L290 TraceCheckUtils]: 97: Hoare triple {28568#(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; {28568#(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 09:49:30,607 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {28568#(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)))} {28737#(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; {28737#(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 09:49:30,607 INFO L290 TraceCheckUtils]: 99: Hoare triple {28737#(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; {28737#(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 09:49:30,608 INFO L290 TraceCheckUtils]: 100: Hoare triple {28737#(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; {28762#(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 09:49:30,608 INFO L290 TraceCheckUtils]: 101: Hoare triple {28762#(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); {28762#(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 09:49:30,609 INFO L272 TraceCheckUtils]: 102: Hoare triple {28762#(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)); {28568#(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 09:49:30,610 INFO L290 TraceCheckUtils]: 103: Hoare triple {28568#(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; {28568#(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 09:49:30,610 INFO L290 TraceCheckUtils]: 104: Hoare triple {28568#(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); {28568#(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 09:49:30,610 INFO L290 TraceCheckUtils]: 105: Hoare triple {28568#(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; {28568#(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 09:49:30,611 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {28568#(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)))} {28762#(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; {28762#(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 09:49:30,611 INFO L290 TraceCheckUtils]: 107: Hoare triple {28762#(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; {28762#(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 09:49:30,612 INFO L290 TraceCheckUtils]: 108: Hoare triple {28762#(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; {28787#(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 09:49:30,612 INFO L290 TraceCheckUtils]: 109: Hoare triple {28787#(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); {28787#(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 09:49:30,613 INFO L272 TraceCheckUtils]: 110: Hoare triple {28787#(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)); {28568#(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 09:49:30,613 INFO L290 TraceCheckUtils]: 111: Hoare triple {28568#(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; {28568#(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 09:49:30,614 INFO L290 TraceCheckUtils]: 112: Hoare triple {28568#(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); {28568#(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 09:49:30,614 INFO L290 TraceCheckUtils]: 113: Hoare triple {28568#(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; {28568#(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 09:49:30,615 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28568#(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)))} {28787#(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; {28787#(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 09:49:30,615 INFO L290 TraceCheckUtils]: 115: Hoare triple {28787#(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; {28787#(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 09:49:30,616 INFO L290 TraceCheckUtils]: 116: Hoare triple {28787#(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; {28812#(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 09:49:30,616 INFO L290 TraceCheckUtils]: 117: Hoare triple {28812#(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); {28812#(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 09:49:30,617 INFO L272 TraceCheckUtils]: 118: Hoare triple {28812#(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)); {28568#(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 09:49:30,617 INFO L290 TraceCheckUtils]: 119: Hoare triple {28568#(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; {28568#(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 09:49:30,617 INFO L290 TraceCheckUtils]: 120: Hoare triple {28568#(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); {28568#(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 09:49:30,618 INFO L290 TraceCheckUtils]: 121: Hoare triple {28568#(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; {28568#(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 09:49:30,618 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {28568#(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)))} {28812#(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; {28812#(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 09:49:30,619 INFO L290 TraceCheckUtils]: 123: Hoare triple {28812#(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; {28812#(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 09:49:30,619 INFO L290 TraceCheckUtils]: 124: Hoare triple {28812#(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; {28837#(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 09:49:30,620 INFO L290 TraceCheckUtils]: 125: Hoare triple {28837#(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); {28837#(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 09:49:30,621 INFO L272 TraceCheckUtils]: 126: Hoare triple {28837#(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)); {28568#(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 09:49:30,621 INFO L290 TraceCheckUtils]: 127: Hoare triple {28568#(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; {28568#(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 09:49:30,621 INFO L290 TraceCheckUtils]: 128: Hoare triple {28568#(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); {28568#(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 09:49:30,622 INFO L290 TraceCheckUtils]: 129: Hoare triple {28568#(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; {28568#(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 09:49:30,622 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {28568#(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)))} {28837#(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; {28837#(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 09:49:30,623 INFO L290 TraceCheckUtils]: 131: Hoare triple {28837#(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; {28837#(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 09:49:30,623 INFO L290 TraceCheckUtils]: 132: Hoare triple {28837#(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; {28862#(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 09:49:30,624 INFO L290 TraceCheckUtils]: 133: Hoare triple {28862#(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); {28862#(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 09:49:30,624 INFO L272 TraceCheckUtils]: 134: Hoare triple {28862#(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)); {28568#(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 09:49:30,625 INFO L290 TraceCheckUtils]: 135: Hoare triple {28568#(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; {28568#(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 09:49:30,625 INFO L290 TraceCheckUtils]: 136: Hoare triple {28568#(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); {28568#(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 09:49:30,625 INFO L290 TraceCheckUtils]: 137: Hoare triple {28568#(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; {28568#(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 09:49:30,626 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {28568#(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)))} {28862#(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; {28862#(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 09:49:30,626 INFO L290 TraceCheckUtils]: 139: Hoare triple {28862#(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; {28862#(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 09:49:30,627 INFO L290 TraceCheckUtils]: 140: Hoare triple {28862#(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; {28887#(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 09:49:30,627 INFO L290 TraceCheckUtils]: 141: Hoare triple {28887#(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); {28429#(= |main_#t~mem5| 0)} is VALID [2022-04-28 09:49:30,628 INFO L272 TraceCheckUtils]: 142: Hoare triple {28429#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {28894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:49:30,628 INFO L290 TraceCheckUtils]: 143: Hoare triple {28894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:49:30,637 INFO L290 TraceCheckUtils]: 144: Hoare triple {28898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28343#false} is VALID [2022-04-28 09:49:30,637 INFO L290 TraceCheckUtils]: 145: Hoare triple {28343#false} assume !false; {28343#false} is VALID [2022-04-28 09:49:30,638 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 09:49:30,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:49:31,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138864684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:49:31,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 09:49:31,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 70 [2022-04-28 09:49:31,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:49:31,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1680471676] [2022-04-28 09:49:31,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1680471676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:49:31,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:49:31,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 09:49:31,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33807696] [2022-04-28 09:49:31,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:49:31,024 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 09:49:31,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:49:31,024 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 09:49:31,097 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 09:49:31,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 09:49:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:31,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 09:49:31,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=4623, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 09:49:31,098 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 09:49:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:37,258 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2022-04-28 09:49:37,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 09:49:37,258 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 09:49:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:49:37,258 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 09:49:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-28 09:49:37,260 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 09:49:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-28 09:49:37,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 124 transitions. [2022-04-28 09:49:37,363 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 09:49:37,365 INFO L225 Difference]: With dead ends: 162 [2022-04-28 09:49:37,365 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 09:49:37,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 120 SyntacticMatches, 26 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=791, Invalid=10339, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 09:49:37,366 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 95 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3518 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 09:49:37,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 190 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3518 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 09:49:37,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 09:49:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-04-28 09:49:37,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:49:37,507 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 09:49:37,508 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 09:49:37,508 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 09:49:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:37,512 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-28 09:49:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-28 09:49:37,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:37,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:37,513 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 09:49:37,513 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 09:49:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:37,514 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-28 09:49:37,515 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-28 09:49:37,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:37,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:37,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:49:37,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:49:37,515 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 09:49:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2022-04-28 09:49:37,517 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2022-04-28 09:49:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:49:37,517 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2022-04-28 09:49:37,517 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 09:49:37,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 158 transitions. [2022-04-28 09:49:37,794 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 09:49:37,794 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-04-28 09:49:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-28 09:49:37,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:49:37,795 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 09:49:37,821 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 09:49:37,995 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 09:49:37,995 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:49:37,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:49:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 53 times [2022-04-28 09:49:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:37,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1642706427] [2022-04-28 09:49:37,997 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:49:37,998 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:49:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 54 times [2022-04-28 09:49:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:49:37,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407209159] [2022-04-28 09:49:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:49:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:49:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:49:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {30048#(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); {29956#true} is VALID [2022-04-28 09:49:38,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-28 09:49:38,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-28 09:49:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} #68#return; {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:38,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-28 09:49:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29982#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-28 09:49:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29987#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-28 09:49:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29992#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:38,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-28 09:49:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29997#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:38,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-28 09:49:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30002#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-28 09:49:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30007#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:38,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-28 09:49:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30012#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-28 09:49:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30017#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-28 09:49:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30022#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:38,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-28 09:49:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30027#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:38,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-28 09:49:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30032#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-28 09:49:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30037#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-04-28 09:49:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {30042#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:38,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {29956#true} call ULTIMATE.init(); {30048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:49:38,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {30048#(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); {29956#true} is VALID [2022-04-28 09:49:38,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-28 09:49:38,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-28 09:49:38,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {29956#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29956#true} is VALID [2022-04-28 09:49:38,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {29956#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; {29961#(= main_~i~0 0)} is VALID [2022-04-28 09:49:38,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {29961#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29961#(= main_~i~0 0)} is VALID [2022-04-28 09:49:38,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {29961#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:38,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {29962#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:38,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {29962#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:38,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {29963#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:38,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {29963#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:38,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {29964#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:38,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {29964#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:38,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {29965#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:38,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {29965#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:38,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {29966#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:38,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {29966#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:38,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {29967#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:38,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {29967#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:38,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {29968#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:38,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {29968#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:38,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {29969#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:38,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {29969#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:38,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {29970#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:38,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {29970#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:38,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {29971#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:38,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {29971#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:38,410 INFO L290 TraceCheckUtils]: 29: Hoare triple {29972#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:38,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {29972#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:38,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {29973#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:38,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {29973#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:38,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {29974#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29974#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:38,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {29974#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29975#(<= main_~i~0 14)} is VALID [2022-04-28 09:49:38,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {29975#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29976#(<= main_~n~0 14)} is VALID [2022-04-28 09:49:38,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {29976#(<= main_~n~0 14)} ~i~1 := 0; {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:38,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {29977#(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); {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:38,413 INFO L272 TraceCheckUtils]: 38: Hoare triple {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,413 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29956#true} {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} #68#return; {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:38,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} havoc #t~mem5; {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:38,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {29977#(and (= main_~i~1 0) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:38,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {29982#(<= 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); {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:38,415 INFO L272 TraceCheckUtils]: 46: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,415 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,415 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29956#true} {29982#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:38,416 INFO L290 TraceCheckUtils]: 51: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:38,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:38,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {29987#(<= 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); {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:38,416 INFO L272 TraceCheckUtils]: 54: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,417 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29956#true} {29987#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:38,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:38,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:38,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {29992#(<= 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); {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:38,418 INFO L272 TraceCheckUtils]: 62: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,419 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29956#true} {29992#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:38,419 INFO L290 TraceCheckUtils]: 67: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:38,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:38,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {29997#(<= 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); {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:38,420 INFO L272 TraceCheckUtils]: 70: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,421 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29956#true} {29997#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:38,421 INFO L290 TraceCheckUtils]: 75: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:38,421 INFO L290 TraceCheckUtils]: 76: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:38,422 INFO L290 TraceCheckUtils]: 77: Hoare triple {30002#(<= 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); {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:38,422 INFO L272 TraceCheckUtils]: 78: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,422 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,422 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,422 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,423 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29956#true} {30002#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:38,423 INFO L290 TraceCheckUtils]: 83: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:38,423 INFO L290 TraceCheckUtils]: 84: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:38,424 INFO L290 TraceCheckUtils]: 85: Hoare triple {30007#(<= 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); {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:38,424 INFO L272 TraceCheckUtils]: 86: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,424 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,424 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,424 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,424 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29956#true} {30007#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:38,425 INFO L290 TraceCheckUtils]: 91: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:38,425 INFO L290 TraceCheckUtils]: 92: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:38,425 INFO L290 TraceCheckUtils]: 93: Hoare triple {30012#(<= 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); {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:38,426 INFO L272 TraceCheckUtils]: 94: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,426 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,426 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,426 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,426 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29956#true} {30012#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:38,427 INFO L290 TraceCheckUtils]: 99: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:38,427 INFO L290 TraceCheckUtils]: 100: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:38,427 INFO L290 TraceCheckUtils]: 101: Hoare triple {30017#(<= 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); {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:38,427 INFO L272 TraceCheckUtils]: 102: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,427 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,428 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,428 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,428 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29956#true} {30017#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:38,428 INFO L290 TraceCheckUtils]: 107: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:38,429 INFO L290 TraceCheckUtils]: 108: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:38,429 INFO L290 TraceCheckUtils]: 109: Hoare triple {30022#(<= 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); {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:38,429 INFO L272 TraceCheckUtils]: 110: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,429 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,429 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,429 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,430 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29956#true} {30022#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:38,430 INFO L290 TraceCheckUtils]: 115: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:38,431 INFO L290 TraceCheckUtils]: 116: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:38,431 INFO L290 TraceCheckUtils]: 117: Hoare triple {30027#(<= 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); {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:38,431 INFO L272 TraceCheckUtils]: 118: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,431 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,431 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,431 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,432 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29956#true} {30027#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:38,432 INFO L290 TraceCheckUtils]: 123: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:38,432 INFO L290 TraceCheckUtils]: 124: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:38,433 INFO L290 TraceCheckUtils]: 125: Hoare triple {30032#(<= 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); {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:38,433 INFO L272 TraceCheckUtils]: 126: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,433 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,433 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,433 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,433 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29956#true} {30032#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:38,434 INFO L290 TraceCheckUtils]: 131: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:38,434 INFO L290 TraceCheckUtils]: 132: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:38,435 INFO L290 TraceCheckUtils]: 133: Hoare triple {30037#(<= 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); {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:38,435 INFO L272 TraceCheckUtils]: 134: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,435 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,435 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,435 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,435 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29956#true} {30037#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:38,436 INFO L290 TraceCheckUtils]: 139: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:38,436 INFO L290 TraceCheckUtils]: 140: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:38,436 INFO L290 TraceCheckUtils]: 141: Hoare triple {30042#(<= 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); {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:38,436 INFO L272 TraceCheckUtils]: 142: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:38,437 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:38,437 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:38,437 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:38,437 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29956#true} {30042#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:38,437 INFO L290 TraceCheckUtils]: 147: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:38,438 INFO L290 TraceCheckUtils]: 148: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30047#(<= main_~n~0 main_~i~1)} is VALID [2022-04-28 09:49:38,438 INFO L290 TraceCheckUtils]: 149: Hoare triple {30047#(<= 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); {29957#false} is VALID [2022-04-28 09:49:38,438 INFO L272 TraceCheckUtils]: 150: Hoare triple {29957#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29957#false} is VALID [2022-04-28 09:49:38,438 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-28 09:49:38,438 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-28 09:49:38,439 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-28 09:49:38,439 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 09:49:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:49:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407209159] [2022-04-28 09:49:38,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407209159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:49:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710133018] [2022-04-28 09:49:38,440 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:49:38,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:49:38,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:49:38,441 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 09:49:38,442 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 09:49:38,808 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 09:49:38,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:49:38,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 09:49:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:38,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:49:40,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {29956#true} call ULTIMATE.init(); {29956#true} is VALID [2022-04-28 09:49:40,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#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); {29956#true} is VALID [2022-04-28 09:49:40,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-28 09:49:40,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-28 09:49:40,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {29956#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29956#true} is VALID [2022-04-28 09:49:40,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {29956#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; {30070#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:40,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {30070#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:40,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {30070#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:40,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {29962#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:40,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {29962#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:40,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {29963#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:40,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {29963#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:40,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {29964#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:40,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {29964#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:40,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {29965#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:40,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {29965#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:40,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {29966#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:40,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {29966#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:40,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {29967#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:40,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {29967#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:40,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {29968#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:40,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {29968#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:40,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {29969#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:40,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {29969#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:40,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {29970#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:40,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {29970#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:40,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {29971#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:40,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {29971#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:40,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {29972#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:40,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {29972#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:40,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {29973#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:40,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {29973#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:40,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {29974#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29974#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:40,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {29974#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29975#(<= main_~i~0 14)} is VALID [2022-04-28 09:49:40,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {29975#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29976#(<= main_~n~0 14)} is VALID [2022-04-28 09:49:40,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {29976#(<= main_~n~0 14)} ~i~1 := 0; {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {30161#(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); {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,072 INFO L272 TraceCheckUtils]: 38: Hoare triple {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,072 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29956#true} {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} #68#return; {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,073 INFO L290 TraceCheckUtils]: 44: Hoare triple {30161#(and (<= 0 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,074 INFO L290 TraceCheckUtils]: 45: Hoare triple {30186#(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); {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,074 INFO L272 TraceCheckUtils]: 46: Hoare triple {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,074 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29956#true} {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} #68#return; {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,075 INFO L290 TraceCheckUtils]: 52: Hoare triple {30186#(and (<= 1 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {30211#(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); {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,076 INFO L272 TraceCheckUtils]: 54: Hoare triple {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,076 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29956#true} {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} #68#return; {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {30211#(and (<= 2 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {30236#(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); {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,078 INFO L272 TraceCheckUtils]: 62: Hoare triple {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,078 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29956#true} {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} #68#return; {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {30236#(and (<= 3 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,080 INFO L290 TraceCheckUtils]: 69: Hoare triple {30261#(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); {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,080 INFO L272 TraceCheckUtils]: 70: Hoare triple {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,080 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,080 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,081 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29956#true} {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} #68#return; {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,081 INFO L290 TraceCheckUtils]: 75: Hoare triple {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,081 INFO L290 TraceCheckUtils]: 76: Hoare triple {30261#(and (<= 4 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,082 INFO L290 TraceCheckUtils]: 77: Hoare triple {30286#(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); {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,082 INFO L272 TraceCheckUtils]: 78: Hoare triple {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,082 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,082 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,082 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,082 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29956#true} {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} #68#return; {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,083 INFO L290 TraceCheckUtils]: 83: Hoare triple {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,083 INFO L290 TraceCheckUtils]: 84: Hoare triple {30286#(and (<= 5 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,084 INFO L290 TraceCheckUtils]: 85: Hoare triple {30311#(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); {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,084 INFO L272 TraceCheckUtils]: 86: Hoare triple {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,084 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,084 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,084 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,084 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29956#true} {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} #68#return; {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,085 INFO L290 TraceCheckUtils]: 91: Hoare triple {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,085 INFO L290 TraceCheckUtils]: 92: Hoare triple {30311#(and (<= 6 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,086 INFO L290 TraceCheckUtils]: 93: Hoare triple {30336#(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); {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,086 INFO L272 TraceCheckUtils]: 94: Hoare triple {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,086 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,086 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,086 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,086 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29956#true} {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} #68#return; {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,087 INFO L290 TraceCheckUtils]: 99: Hoare triple {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,087 INFO L290 TraceCheckUtils]: 100: Hoare triple {30336#(and (<= 7 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,088 INFO L290 TraceCheckUtils]: 101: Hoare triple {30361#(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); {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,088 INFO L272 TraceCheckUtils]: 102: Hoare triple {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,088 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,088 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,088 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,088 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29956#true} {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} #68#return; {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,089 INFO L290 TraceCheckUtils]: 107: Hoare triple {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,089 INFO L290 TraceCheckUtils]: 108: Hoare triple {30361#(and (<= 8 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,090 INFO L290 TraceCheckUtils]: 109: Hoare triple {30386#(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); {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,090 INFO L272 TraceCheckUtils]: 110: Hoare triple {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,090 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,090 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,090 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,090 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29956#true} {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} #68#return; {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,091 INFO L290 TraceCheckUtils]: 115: Hoare triple {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,091 INFO L290 TraceCheckUtils]: 116: Hoare triple {30386#(and (<= 9 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,091 INFO L290 TraceCheckUtils]: 117: Hoare triple {30411#(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); {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,092 INFO L272 TraceCheckUtils]: 118: Hoare triple {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,092 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,092 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,092 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,092 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29956#true} {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} #68#return; {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,093 INFO L290 TraceCheckUtils]: 123: Hoare triple {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,093 INFO L290 TraceCheckUtils]: 124: Hoare triple {30411#(and (<= 10 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,093 INFO L290 TraceCheckUtils]: 125: Hoare triple {30436#(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); {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,094 INFO L272 TraceCheckUtils]: 126: Hoare triple {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,094 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,094 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,094 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,094 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29956#true} {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} #68#return; {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,095 INFO L290 TraceCheckUtils]: 131: Hoare triple {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,095 INFO L290 TraceCheckUtils]: 132: Hoare triple {30436#(and (<= 11 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,095 INFO L290 TraceCheckUtils]: 133: Hoare triple {30461#(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); {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,096 INFO L272 TraceCheckUtils]: 134: Hoare triple {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,096 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,096 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,096 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,096 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29956#true} {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} #68#return; {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,097 INFO L290 TraceCheckUtils]: 139: Hoare triple {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,097 INFO L290 TraceCheckUtils]: 140: Hoare triple {30461#(and (<= 12 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,097 INFO L290 TraceCheckUtils]: 141: Hoare triple {30486#(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); {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,098 INFO L272 TraceCheckUtils]: 142: Hoare triple {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,098 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,098 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,098 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,098 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29956#true} {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} #68#return; {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,099 INFO L290 TraceCheckUtils]: 147: Hoare triple {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} havoc #t~mem5; {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,099 INFO L290 TraceCheckUtils]: 148: Hoare triple {30486#(and (<= 13 main_~i~1) (<= main_~n~0 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30511#(and (<= 14 main_~i~1) (<= main_~n~0 14))} is VALID [2022-04-28 09:49:40,099 INFO L290 TraceCheckUtils]: 149: Hoare triple {30511#(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); {29957#false} is VALID [2022-04-28 09:49:40,100 INFO L272 TraceCheckUtils]: 150: Hoare triple {29957#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29957#false} is VALID [2022-04-28 09:49:40,100 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-28 09:49:40,100 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-28 09:49:40,100 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-28 09:49:40,100 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 09:49:40,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:49:40,778 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-28 09:49:40,778 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-28 09:49:40,778 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-28 09:49:40,779 INFO L272 TraceCheckUtils]: 150: Hoare triple {29957#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29957#false} is VALID [2022-04-28 09:49:40,779 INFO L290 TraceCheckUtils]: 149: Hoare triple {30047#(<= 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); {29957#false} is VALID [2022-04-28 09:49:40,779 INFO L290 TraceCheckUtils]: 148: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30047#(<= main_~n~0 main_~i~1)} is VALID [2022-04-28 09:49:40,780 INFO L290 TraceCheckUtils]: 147: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:40,780 INFO L284 TraceCheckUtils]: 146: Hoare quadruple {29956#true} {30042#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:40,780 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,780 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,781 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,781 INFO L272 TraceCheckUtils]: 142: Hoare triple {30042#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,781 INFO L290 TraceCheckUtils]: 141: Hoare triple {30042#(<= 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); {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:40,781 INFO L290 TraceCheckUtils]: 140: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30042#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-28 09:49:40,782 INFO L290 TraceCheckUtils]: 139: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:40,782 INFO L284 TraceCheckUtils]: 138: Hoare quadruple {29956#true} {30037#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:40,782 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,782 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,782 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,783 INFO L272 TraceCheckUtils]: 134: Hoare triple {30037#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,783 INFO L290 TraceCheckUtils]: 133: Hoare triple {30037#(<= 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); {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:40,783 INFO L290 TraceCheckUtils]: 132: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30037#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-28 09:49:40,784 INFO L290 TraceCheckUtils]: 131: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:40,784 INFO L284 TraceCheckUtils]: 130: Hoare quadruple {29956#true} {30032#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:40,784 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,784 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,785 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,785 INFO L272 TraceCheckUtils]: 126: Hoare triple {30032#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,785 INFO L290 TraceCheckUtils]: 125: Hoare triple {30032#(<= 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); {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:40,785 INFO L290 TraceCheckUtils]: 124: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30032#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-28 09:49:40,786 INFO L290 TraceCheckUtils]: 123: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:40,786 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {29956#true} {30027#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:40,786 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,786 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,786 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,787 INFO L272 TraceCheckUtils]: 118: Hoare triple {30027#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,787 INFO L290 TraceCheckUtils]: 117: Hoare triple {30027#(<= 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); {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:40,787 INFO L290 TraceCheckUtils]: 116: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30027#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-28 09:49:40,788 INFO L290 TraceCheckUtils]: 115: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:40,788 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {29956#true} {30022#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:40,788 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,788 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,788 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,788 INFO L272 TraceCheckUtils]: 110: Hoare triple {30022#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,789 INFO L290 TraceCheckUtils]: 109: Hoare triple {30022#(<= 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); {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:40,789 INFO L290 TraceCheckUtils]: 108: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30022#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-28 09:49:40,790 INFO L290 TraceCheckUtils]: 107: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:40,790 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {29956#true} {30017#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:40,790 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,790 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,790 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,790 INFO L272 TraceCheckUtils]: 102: Hoare triple {30017#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,791 INFO L290 TraceCheckUtils]: 101: Hoare triple {30017#(<= 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); {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:40,791 INFO L290 TraceCheckUtils]: 100: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30017#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-28 09:49:40,792 INFO L290 TraceCheckUtils]: 99: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:40,792 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {29956#true} {30012#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:40,792 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,792 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,792 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,793 INFO L272 TraceCheckUtils]: 94: Hoare triple {30012#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,793 INFO L290 TraceCheckUtils]: 93: Hoare triple {30012#(<= 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); {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:40,793 INFO L290 TraceCheckUtils]: 92: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30012#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-28 09:49:40,794 INFO L290 TraceCheckUtils]: 91: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:40,794 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29956#true} {30007#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:40,794 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,794 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,794 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,795 INFO L272 TraceCheckUtils]: 86: Hoare triple {30007#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {30007#(<= 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); {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:40,795 INFO L290 TraceCheckUtils]: 84: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30007#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-28 09:49:40,796 INFO L290 TraceCheckUtils]: 83: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:40,796 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29956#true} {30002#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:40,796 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,796 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,796 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,797 INFO L272 TraceCheckUtils]: 78: Hoare triple {30002#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,797 INFO L290 TraceCheckUtils]: 77: Hoare triple {30002#(<= 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); {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:40,797 INFO L290 TraceCheckUtils]: 76: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {30002#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-28 09:49:40,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:40,798 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29956#true} {29997#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:40,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,799 INFO L272 TraceCheckUtils]: 70: Hoare triple {29997#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,799 INFO L290 TraceCheckUtils]: 69: Hoare triple {29997#(<= 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); {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:40,799 INFO L290 TraceCheckUtils]: 68: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29997#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-28 09:49:40,800 INFO L290 TraceCheckUtils]: 67: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:40,800 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {29956#true} {29992#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:40,800 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,800 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,801 INFO L272 TraceCheckUtils]: 62: Hoare triple {29992#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,801 INFO L290 TraceCheckUtils]: 61: Hoare triple {29992#(<= 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); {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:40,801 INFO L290 TraceCheckUtils]: 60: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29992#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-28 09:49:40,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:40,802 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {29956#true} {29987#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:40,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,802 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,802 INFO L272 TraceCheckUtils]: 54: Hoare triple {29987#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {29987#(<= 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); {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:40,803 INFO L290 TraceCheckUtils]: 52: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29987#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-28 09:49:40,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:40,804 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29956#true} {29982#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:40,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,804 INFO L272 TraceCheckUtils]: 46: Hoare triple {29982#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,805 INFO L290 TraceCheckUtils]: 45: Hoare triple {29982#(<= 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); {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:40,805 INFO L290 TraceCheckUtils]: 44: Hoare triple {30854#(<= main_~n~0 (+ main_~i~1 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {29982#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-28 09:49:40,805 INFO L290 TraceCheckUtils]: 43: Hoare triple {30854#(<= main_~n~0 (+ main_~i~1 14))} havoc #t~mem5; {30854#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-28 09:49:40,806 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {29956#true} {30854#(<= main_~n~0 (+ main_~i~1 14))} #68#return; {30854#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-28 09:49:40,806 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,806 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-28 09:49:40,806 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-28 09:49:40,806 INFO L272 TraceCheckUtils]: 38: Hoare triple {30854#(<= main_~n~0 (+ main_~i~1 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29956#true} is VALID [2022-04-28 09:49:40,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {30854#(<= 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); {30854#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-28 09:49:40,807 INFO L290 TraceCheckUtils]: 36: Hoare triple {29976#(<= main_~n~0 14)} ~i~1 := 0; {30854#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-28 09:49:40,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {29975#(<= main_~i~0 14)} assume !(~i~0 < ~n~0); {29976#(<= main_~n~0 14)} is VALID [2022-04-28 09:49:40,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {29974#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29975#(<= main_~i~0 14)} is VALID [2022-04-28 09:49:40,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {29974#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29974#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:40,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {29973#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29974#(<= main_~i~0 13)} is VALID [2022-04-28 09:49:40,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {29973#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29973#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:40,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {29972#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29973#(<= main_~i~0 12)} is VALID [2022-04-28 09:49:40,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {29972#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29972#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:40,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {29971#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29972#(<= main_~i~0 11)} is VALID [2022-04-28 09:49:40,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {29971#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29971#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:40,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {29970#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29971#(<= main_~i~0 10)} is VALID [2022-04-28 09:49:40,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {29970#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29970#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:40,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {29969#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29970#(<= main_~i~0 9)} is VALID [2022-04-28 09:49:40,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {29969#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29969#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:40,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {29968#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29969#(<= main_~i~0 8)} is VALID [2022-04-28 09:49:40,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {29968#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29968#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:40,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {29967#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29968#(<= main_~i~0 7)} is VALID [2022-04-28 09:49:40,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {29967#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29967#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:40,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {29966#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29967#(<= main_~i~0 6)} is VALID [2022-04-28 09:49:40,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {29966#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29966#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:40,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {29965#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29966#(<= main_~i~0 5)} is VALID [2022-04-28 09:49:40,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {29965#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29965#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:40,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {29964#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29965#(<= main_~i~0 4)} is VALID [2022-04-28 09:49:40,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {29964#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29964#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:40,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {29963#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29964#(<= main_~i~0 3)} is VALID [2022-04-28 09:49:40,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {29963#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29963#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:40,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {29962#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29963#(<= main_~i~0 2)} is VALID [2022-04-28 09:49:40,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {29962#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {29962#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:40,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {30070#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29962#(<= main_~i~0 1)} is VALID [2022-04-28 09:49:40,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {30070#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {30070#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:40,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {29956#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; {30070#(<= main_~i~0 0)} is VALID [2022-04-28 09:49:40,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {29956#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {29956#true} is VALID [2022-04-28 09:49:40,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-28 09:49:40,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-28 09:49:40,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-28 09:49:40,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#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); {29956#true} is VALID [2022-04-28 09:49:40,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {29956#true} call ULTIMATE.init(); {29956#true} is VALID [2022-04-28 09:49:40,819 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 09:49:40,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710133018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:49:40,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:49:40,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 51 [2022-04-28 09:49:40,820 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:49:40,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1642706427] [2022-04-28 09:49:40,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1642706427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:49:40,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:49:40,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 09:49:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692343085] [2022-04-28 09:49:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:49:40,821 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 09:49:40,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:49:40,821 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 09:49:40,894 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 09:49:40,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 09:49:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 09:49:40,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1983, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 09:49:40,896 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 09:49:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:42,730 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2022-04-28 09:49:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 09:49:42,731 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 09:49:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:49:42,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 09:49:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-28 09:49:42,732 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 09:49:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-28 09:49:42,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 134 transitions. [2022-04-28 09:49:42,831 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 09:49:42,833 INFO L225 Difference]: With dead ends: 228 [2022-04-28 09:49:42,833 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 09:49:42,834 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 09:49:42,834 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 09:49:42,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 93 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 09:49:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 09:49:42,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-04-28 09:49:42,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:49:42,989 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 09:49:42,990 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 09:49:42,990 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 09:49:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:42,992 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-28 09:49:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-28 09:49:42,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:42,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:42,992 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 09:49:42,992 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 09:49:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:49:42,994 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-28 09:49:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-28 09:49:42,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:49:42,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:49:42,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:49:42,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:49:42,994 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 09:49:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-04-28 09:49:42,996 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2022-04-28 09:49:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:49:42,996 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-04-28 09:49:42,996 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 09:49:42,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 160 transitions. [2022-04-28 09:49:43,274 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 09:49:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-04-28 09:49:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-28 09:49:43,275 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:49:43,275 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 09:49:43,295 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 09:49:43,475 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 09:49:43,476 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:49:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:49:43,476 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 55 times [2022-04-28 09:49:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:49:43,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120088969] [2022-04-28 09:49:43,478 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:49:43,478 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:49:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 56 times [2022-04-28 09:49:43,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:49:43,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741068811] [2022-04-28 09:49:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:49:43,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:49:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:49:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {32241#(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); {32145#true} is VALID [2022-04-28 09:49:44,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32145#true} {32145#true} #70#return; {32145#true} is VALID [2022-04-28 09:49:44,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-28 09:49:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} #68#return; {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-28 09:49:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #68#return; {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-28 09:49:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:44,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-28 09:49:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-28 09:49:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-28 09:49:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-28 09:49:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-28 09:49:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-28 09:49:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-28 09:49:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-04-28 09:49:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-04-28 09:49:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:44,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-04-28 09:49:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:44,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-28 09:49:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:44,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {32145#true} call ULTIMATE.init(); {32241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:49:44,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {32241#(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); {32145#true} is VALID [2022-04-28 09:49:44,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32145#true} #70#return; {32145#true} is VALID [2022-04-28 09:49:44,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {32145#true} call #t~ret6 := main(); {32145#true} is VALID [2022-04-28 09:49:44,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {32145#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {32145#true} is VALID [2022-04-28 09:49:44,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {32145#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; {32150#(= main_~i~0 0)} is VALID [2022-04-28 09:49:44,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {32150#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {32150#(= main_~i~0 0)} is VALID [2022-04-28 09:49:44,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {32150#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32151#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:49:44,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {32151#(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); {32151#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-28 09:49:44,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {32151#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32152#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:49:44,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {32152#(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); {32152#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-28 09:49:44,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {32152#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32153#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:49:44,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {32153#(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); {32153#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-28 09:49:44,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {32153#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32154#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 09:49:44,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {32154#(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); {32154#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-28 09:49:44,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {32154#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32155#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 09:49:44,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {32155#(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); {32155#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-28 09:49:44,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {32155#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32156#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 09:49:44,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {32156#(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); {32156#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-28 09:49:44,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {32156#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32157#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 09:49:44,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {32157#(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); {32157#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-28 09:49:44,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {32157#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32158#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 09:49:44,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {32158#(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); {32158#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-28 09:49:44,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {32158#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32159#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 09:49:44,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {32159#(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); {32159#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-28 09:49:44,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {32159#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32160#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 09:49:44,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {32160#(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); {32160#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-28 09:49:44,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {32160#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32161#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 09:49:44,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {32161#(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); {32161#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-28 09:49:44,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {32161#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32162#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 09:49:44,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {32162#(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); {32162#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-28 09:49:44,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {32162#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32163#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 09:49:44,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {32163#(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); {32163#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-28 09:49:44,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {32163#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32164#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-28 09:49:44,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {32164#(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); {32165#(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 09:49:44,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {32165#(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; {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} is VALID [2022-04-28 09:49:44,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} assume !(~i~0 < ~n~0); {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} is VALID [2022-04-28 09:49:44,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} ~i~1 := 0; {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:44,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {32167#(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); {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:44,269 INFO L272 TraceCheckUtils]: 40: Hoare triple {32167#(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)); {32145#true} is VALID [2022-04-28 09:49:44,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,269 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {32145#true} {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} #68#return; {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:44,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} havoc #t~mem5; {32167#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 0))} is VALID [2022-04-28 09:49:44,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {32167#(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; {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {32172#(= (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); {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,271 INFO L272 TraceCheckUtils]: 48: Hoare triple {32172#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,271 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {32145#true} {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #68#return; {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} havoc #t~mem5; {32172#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {32172#(= (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; {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:44,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {32177#(= (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); {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:44,273 INFO L272 TraceCheckUtils]: 56: Hoare triple {32177#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,273 INFO L290 TraceCheckUtils]: 59: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,273 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {32145#true} {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:44,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} havoc #t~mem5; {32177#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-28 09:49:44,274 INFO L290 TraceCheckUtils]: 62: Hoare triple {32177#(= (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; {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {32182#(= (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); {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,275 INFO L272 TraceCheckUtils]: 64: Hoare triple {32182#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,275 INFO L290 TraceCheckUtils]: 65: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,275 INFO L290 TraceCheckUtils]: 66: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,275 INFO L290 TraceCheckUtils]: 67: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,276 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {32145#true} {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {32182#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {32182#(= (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; {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,277 INFO L290 TraceCheckUtils]: 71: Hoare triple {32187#(= (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); {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,277 INFO L272 TraceCheckUtils]: 72: Hoare triple {32187#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,277 INFO L290 TraceCheckUtils]: 73: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,277 INFO L290 TraceCheckUtils]: 74: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,277 INFO L290 TraceCheckUtils]: 75: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,278 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {32145#true} {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,278 INFO L290 TraceCheckUtils]: 77: Hoare triple {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {32187#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,278 INFO L290 TraceCheckUtils]: 78: Hoare triple {32187#(= (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; {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:44,279 INFO L290 TraceCheckUtils]: 79: Hoare triple {32192#(= (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); {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:44,279 INFO L272 TraceCheckUtils]: 80: Hoare triple {32192#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,279 INFO L290 TraceCheckUtils]: 81: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,279 INFO L290 TraceCheckUtils]: 82: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,279 INFO L290 TraceCheckUtils]: 83: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,280 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {32145#true} {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:44,280 INFO L290 TraceCheckUtils]: 85: Hoare triple {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {32192#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-28 09:49:44,280 INFO L290 TraceCheckUtils]: 86: Hoare triple {32192#(= (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; {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,281 INFO L290 TraceCheckUtils]: 87: Hoare triple {32197#(= (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); {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,281 INFO L272 TraceCheckUtils]: 88: Hoare triple {32197#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,281 INFO L290 TraceCheckUtils]: 89: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,281 INFO L290 TraceCheckUtils]: 90: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,281 INFO L290 TraceCheckUtils]: 91: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,282 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32145#true} {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,282 INFO L290 TraceCheckUtils]: 93: Hoare triple {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {32197#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,283 INFO L290 TraceCheckUtils]: 94: Hoare triple {32197#(= (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; {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:44,283 INFO L290 TraceCheckUtils]: 95: Hoare triple {32202#(= (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); {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:44,283 INFO L272 TraceCheckUtils]: 96: Hoare triple {32202#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,283 INFO L290 TraceCheckUtils]: 97: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,283 INFO L290 TraceCheckUtils]: 98: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,283 INFO L290 TraceCheckUtils]: 99: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,284 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {32145#true} {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:44,284 INFO L290 TraceCheckUtils]: 101: Hoare triple {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {32202#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-28 09:49:44,285 INFO L290 TraceCheckUtils]: 102: Hoare triple {32202#(= (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; {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:44,285 INFO L290 TraceCheckUtils]: 103: Hoare triple {32207#(= (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); {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:44,285 INFO L272 TraceCheckUtils]: 104: Hoare triple {32207#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,285 INFO L290 TraceCheckUtils]: 105: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,285 INFO L290 TraceCheckUtils]: 106: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,285 INFO L290 TraceCheckUtils]: 107: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,286 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32145#true} {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:44,286 INFO L290 TraceCheckUtils]: 109: Hoare triple {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {32207#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-28 09:49:44,287 INFO L290 TraceCheckUtils]: 110: Hoare triple {32207#(= (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; {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:44,287 INFO L290 TraceCheckUtils]: 111: Hoare triple {32212#(= (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); {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:44,287 INFO L272 TraceCheckUtils]: 112: Hoare triple {32212#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,287 INFO L290 TraceCheckUtils]: 113: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,287 INFO L290 TraceCheckUtils]: 114: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,287 INFO L290 TraceCheckUtils]: 115: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,288 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {32145#true} {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:44,288 INFO L290 TraceCheckUtils]: 117: Hoare triple {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {32212#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-28 09:49:44,289 INFO L290 TraceCheckUtils]: 118: Hoare triple {32212#(= (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; {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,289 INFO L290 TraceCheckUtils]: 119: Hoare triple {32217#(= (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); {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,289 INFO L272 TraceCheckUtils]: 120: Hoare triple {32217#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,289 INFO L290 TraceCheckUtils]: 121: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,289 INFO L290 TraceCheckUtils]: 122: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,289 INFO L290 TraceCheckUtils]: 123: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,290 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {32145#true} {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,290 INFO L290 TraceCheckUtils]: 125: Hoare triple {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {32217#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,291 INFO L290 TraceCheckUtils]: 126: Hoare triple {32217#(= (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; {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:44,291 INFO L290 TraceCheckUtils]: 127: Hoare triple {32222#(= (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); {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:44,291 INFO L272 TraceCheckUtils]: 128: Hoare triple {32222#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,291 INFO L290 TraceCheckUtils]: 129: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,291 INFO L290 TraceCheckUtils]: 130: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,291 INFO L290 TraceCheckUtils]: 131: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,292 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {32145#true} {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:44,292 INFO L290 TraceCheckUtils]: 133: Hoare triple {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {32222#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-28 09:49:44,293 INFO L290 TraceCheckUtils]: 134: Hoare triple {32222#(= (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; {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:44,293 INFO L290 TraceCheckUtils]: 135: Hoare triple {32227#(= 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); {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:44,293 INFO L272 TraceCheckUtils]: 136: Hoare triple {32227#(= 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)); {32145#true} is VALID [2022-04-28 09:49:44,293 INFO L290 TraceCheckUtils]: 137: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,293 INFO L290 TraceCheckUtils]: 138: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,293 INFO L290 TraceCheckUtils]: 139: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,294 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {32145#true} {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:44,294 INFO L290 TraceCheckUtils]: 141: Hoare triple {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {32227#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-28 09:49:44,295 INFO L290 TraceCheckUtils]: 142: Hoare triple {32227#(= 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; {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:44,295 INFO L290 TraceCheckUtils]: 143: Hoare triple {32232#(= (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); {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:44,295 INFO L272 TraceCheckUtils]: 144: Hoare triple {32232#(= (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)); {32145#true} is VALID [2022-04-28 09:49:44,295 INFO L290 TraceCheckUtils]: 145: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-28 09:49:44,296 INFO L290 TraceCheckUtils]: 146: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-28 09:49:44,296 INFO L290 TraceCheckUtils]: 147: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-28 09:49:44,296 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {32145#true} {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:44,296 INFO L290 TraceCheckUtils]: 149: Hoare triple {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {32232#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-28 09:49:44,297 INFO L290 TraceCheckUtils]: 150: Hoare triple {32232#(= (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; {32237#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-28 09:49:44,297 INFO L290 TraceCheckUtils]: 151: Hoare triple {32237#(= (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); {32238#(= |main_#t~mem5| 0)} is VALID [2022-04-28 09:49:44,298 INFO L272 TraceCheckUtils]: 152: Hoare triple {32238#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32239#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:49:44,298 INFO L290 TraceCheckUtils]: 153: Hoare triple {32239#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32240#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:49:44,298 INFO L290 TraceCheckUtils]: 154: Hoare triple {32240#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32146#false} is VALID [2022-04-28 09:49:44,298 INFO L290 TraceCheckUtils]: 155: Hoare triple {32146#false} assume !false; {32146#false} is VALID [2022-04-28 09:49:44,299 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 09:49:44,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:49:44,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741068811] [2022-04-28 09:49:44,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741068811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:49:44,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484704954] [2022-04-28 09:49:44,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:49:44,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:49:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:49:44,301 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 09:49:44,301 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 09:49:44,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:49:44,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:49:44,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-28 09:49:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:49:44,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:49:44,680 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