/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-e106359-m [2022-04-15 12:32:12,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:32:12,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:32:12,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:32:12,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:32:12,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:32:12,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:32:12,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:32:12,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:32:12,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:32:12,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:32:12,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:32:12,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:32:12,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:32:12,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:32:12,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:32:12,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:32:12,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:32:12,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:32:12,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:32:12,407 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:32:12,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:32:12,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:32:12,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:32:12,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:32:12,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:32:12,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:32:12,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:32:12,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:32:12,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:32:12,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:32:12,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:32:12,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:32:12,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:32:12,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:32:12,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:32:12,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:32:12,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:32:12,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:32:12,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:32:12,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:32:12,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:32:12,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:32:12,435 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:32:12,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:32:12,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:32:12,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:32:12,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:32:12,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:32:12,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:32:12,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:32:12,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:32:12,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:32:12,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:32:12,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:32:12,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:32:12,439 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:32:12,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:32:12,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:12,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:32:12,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:32:12,439 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:32:12,439 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:32:12,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:32:12,440 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:32:12,440 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:32:12,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:32:12,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:32:12,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:32:12,692 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:32:12,693 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:32:12,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-15 12:32:12,746 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1eda5de5/4c5591849b114c88b12fd95491d01bfc/FLAGb52bcf8ec [2022-04-15 12:32:13,088 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:32:13,089 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i [2022-04-15 12:32:13,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1eda5de5/4c5591849b114c88b12fd95491d01bfc/FLAGb52bcf8ec [2022-04-15 12:32:13,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1eda5de5/4c5591849b114c88b12fd95491d01bfc [2022-04-15 12:32:13,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:32:13,107 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:32:13,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:13,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:32:13,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:32:13,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ba4b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13, skipping insertion in model container [2022-04-15 12:32:13,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:32:13,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:32:13,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i[1009,1022] [2022-04-15 12:32:13,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:13,324 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:32:13,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006.i[1009,1022] [2022-04-15 12:32:13,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:13,362 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:32:13,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13 WrapperNode [2022-04-15 12:32:13,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:13,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:32:13,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:32:13,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:32:13,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:32:13,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:32:13,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:32:13,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:32:13,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (1/1) ... [2022-04-15 12:32:13,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:13,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:13,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:32:13,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:32:13,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:32:13,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:32:13,487 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:32:13,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:32:13,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:32:13,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:32:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 12:32:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:32:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:32:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:32:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:32:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:32:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:32:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:32:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:32:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 12:32:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:32:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:32:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:32:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:32:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:32:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:32:13,562 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:32:13,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:32:13,699 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:32:13,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:32:13,704 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 12:32:13,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:13 BoogieIcfgContainer [2022-04-15 12:32:13,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:32:13,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:32:13,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:32:13,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:32:13,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:13" (1/3) ... [2022-04-15 12:32:13,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6841d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:13, skipping insertion in model container [2022-04-15 12:32:13,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:13" (2/3) ... [2022-04-15 12:32:13,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e6841d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:13, skipping insertion in model container [2022-04-15 12:32:13,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:13" (3/3) ... [2022-04-15 12:32:13,712 INFO L111 eAbstractionObserver]: Analyzing ICFG mcmillan2006.i [2022-04-15 12:32:13,716 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:32:13,717 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:32:13,749 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:32:13,755 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:32:13,755 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:32:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:32:13,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:13,775 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:13,775 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 1 times [2022-04-15 12:32:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:13,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [778400221] [2022-04-15 12:32:13,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1868594418, now seen corresponding path program 2 times [2022-04-15 12:32:13,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:13,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913415914] [2022-04-15 12:32:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:14,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {28#true} is VALID [2022-04-15 12:32:14,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:32:14,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-15 12:32:14,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:14,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {28#true} is VALID [2022-04-15 12:32:14,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 12:32:14,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2022-04-15 12:32:14,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-15 12:32:14,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2022-04-15 12:32:14,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {33#(= main_~i~0 0)} is VALID [2022-04-15 12:32:14,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(= main_~i~0 0)} assume !(~i~0 < ~n~0); {34#(<= main_~n~0 0)} is VALID [2022-04-15 12:32:14,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#(<= main_~n~0 0)} ~i~1 := 0; {35#(and (<= main_~n~0 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:14,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#(and (<= main_~n~0 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {29#false} is VALID [2022-04-15 12:32:14,043 INFO L272 TraceCheckUtils]: 10: Hoare triple {29#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {29#false} is VALID [2022-04-15 12:32:14,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 12:32:14,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 12:32:14,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 12:32:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:14,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913415914] [2022-04-15 12:32:14,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913415914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:14,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:14,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:32:14,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:14,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [778400221] [2022-04-15 12:32:14,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [778400221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:14,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:14,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:32:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966596547] [2022-04-15 12:32:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:14,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:32:14,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:14,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:14,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:14,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:32:14,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:14,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:32:14,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:32:14,091 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:14,354 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-15 12:32:14,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:32:14,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:32:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-15 12:32:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-15 12:32:14,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-15 12:32:14,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:14,418 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:32:14,419 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 12:32:14,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:32:14,424 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:14,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 39 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 12:32:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-15 12:32:14,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:14,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:14,447 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:14,447 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:14,450 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 12:32:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 12:32:14,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:14,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:14,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 12:32:14,451 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-15 12:32:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:14,453 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-15 12:32:14,453 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 12:32:14,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:14,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:14,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:14,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-15 12:32:14,457 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2022-04-15 12:32:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:14,457 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-15 12:32:14,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:14,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-15 12:32:14,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 12:32:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:32:14,478 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:14,478 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:14,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:32:14,478 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:14,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:14,479 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 1 times [2022-04-15 12:32:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:14,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [100602320] [2022-04-15 12:32:14,492 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:14,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash -426319892, now seen corresponding path program 2 times [2022-04-15 12:32:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:14,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345355627] [2022-04-15 12:32:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:14,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {227#true} is VALID [2022-04-15 12:32:14,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-15 12:32:14,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-15 12:32:14,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:14,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {227#true} is VALID [2022-04-15 12:32:14,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-15 12:32:14,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-15 12:32:14,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-15 12:32:14,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-15 12:32:14,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 12:32:14,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {233#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 12:32:14,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 12:32:14,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 12:32:14,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} ~i~1 := 0; {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:14,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:14,671 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {237#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:14,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {237#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {238#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:14,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {238#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {228#false} is VALID [2022-04-15 12:32:14,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-15 12:32:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:14,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345355627] [2022-04-15 12:32:14,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345355627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:14,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335479175] [2022-04-15 12:32:14,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:14,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:14,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:32:14,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:14,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:14,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 12:32:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:14,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:14,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-15 12:32:14,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-04-15 12:32:14,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-15 12:32:14,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {227#true} is VALID [2022-04-15 12:32:14,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-15 12:32:14,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-15 12:32:14,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-15 12:32:14,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-15 12:32:14,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 12:32:14,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {232#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 12:32:14,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 12:32:14,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} assume !(~i~0 < ~n~0); {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} is VALID [2022-04-15 12:32:14,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#(and (= (select (select |#memory_int| main_~x~0.base) 0) 0) (= main_~x~0.offset 0))} ~i~1 := 0; {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:14,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:14,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:32:14,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:32:14,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-15 12:32:14,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-15 12:32:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:14,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:15,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-04-15 12:32:15,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-04-15 12:32:15,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-15 12:32:15,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {228#false} is VALID [2022-04-15 12:32:15,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:32:15,135 INFO L272 TraceCheckUtils]: 12: Hoare triple {236#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:32:15,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {302#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {236#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:15,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} ~i~1 := 0; {302#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:15,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} assume !(~i~0 < ~n~0); {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-15 12:32:15,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-15 12:32:15,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(= 0 (* main_~i~0 4))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {306#(= (select (select |#memory_int| main_~x~0.base) main_~x~0.offset) 0)} is VALID [2022-04-15 12:32:15,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {316#(= 0 (* main_~i~0 4))} is VALID [2022-04-15 12:32:15,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {227#true} is VALID [2022-04-15 12:32:15,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret6 := main(); {227#true} is VALID [2022-04-15 12:32:15,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #70#return; {227#true} is VALID [2022-04-15 12:32:15,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2022-04-15 12:32:15,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {227#true} is VALID [2022-04-15 12:32:15,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-15 12:32:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:15,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335479175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:15,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:15,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 15 [2022-04-15 12:32:15,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:15,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [100602320] [2022-04-15 12:32:15,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [100602320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:15,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:15,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:32:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854113119] [2022-04-15 12:32:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:15,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:32:15,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:15,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:15,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:15,154 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:32:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:32:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:32:15,155 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:15,505 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 12:32:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:32:15,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:32:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-15 12:32:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-15 12:32:15,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-15 12:32:15,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:15,537 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:32:15,537 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:32:15,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:32:15,539 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:15,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 48 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:32:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-15 12:32:15,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:15,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:15,544 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:15,544 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:15,546 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 12:32:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 12:32:15,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:15,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:15,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 12:32:15,547 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 12:32:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:15,548 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 12:32:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 12:32:15,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:15,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:15,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:15,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-15 12:32:15,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2022-04-15 12:32:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:15,551 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-15 12:32:15,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:15,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-15 12:32:15,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 12:32:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 12:32:15,576 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:15,576 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:15,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:15,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:15,811 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:15,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 1 times [2022-04-15 12:32:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:15,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556621426] [2022-04-15 12:32:15,815 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:15,815 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:15,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1328899642, now seen corresponding path program 2 times [2022-04-15 12:32:15,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:15,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364728694] [2022-04-15 12:32:15,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:15,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:15,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {534#true} is VALID [2022-04-15 12:32:15,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 12:32:15,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-15 12:32:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 12:32:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:15,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-15 12:32:15,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-15 12:32:15,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 12:32:15,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #68#return; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 12:32:15,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:15,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {534#true} is VALID [2022-04-15 12:32:15,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 12:32:15,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-15 12:32:15,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-15 12:32:15,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-15 12:32:15,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {539#(= main_~i~0 0)} is VALID [2022-04-15 12:32:15,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {539#(= main_~i~0 0)} is VALID [2022-04-15 12:32:15,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:15,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-15 12:32:15,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 12:32:15,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 12:32:15,919 INFO L272 TraceCheckUtils]: 12: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-15 12:32:15,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-15 12:32:15,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-15 12:32:15,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 12:32:15,920 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #68#return; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 12:32:15,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} havoc #t~mem5; {542#(and (<= main_~n~0 1) (= main_~i~1 0))} is VALID [2022-04-15 12:32:15,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {542#(and (<= main_~n~0 1) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {547#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:15,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-15 12:32:15,921 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-15 12:32:15,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-15 12:32:15,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-15 12:32:15,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-15 12:32:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:15,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364728694] [2022-04-15 12:32:15,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364728694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:15,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754131058] [2022-04-15 12:32:15,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:15,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:15,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:15,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:15,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:32:15,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:15,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:15,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:32:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:15,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:16,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-15 12:32:16,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {534#true} is VALID [2022-04-15 12:32:16,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 12:32:16,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-15 12:32:16,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-15 12:32:16,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-15 12:32:16,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {570#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:16,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {570#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:16,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:16,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-15 12:32:16,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 12:32:16,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 12:32:16,122 INFO L272 TraceCheckUtils]: 12: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-15 12:32:16,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-15 12:32:16,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-15 12:32:16,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 12:32:16,123 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #68#return; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 12:32:16,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} havoc #t~mem5; {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 12:32:16,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {583#(and (<= 0 main_~i~1) (<= main_~n~0 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {608#(and (<= 1 main_~i~1) (<= main_~n~0 1))} is VALID [2022-04-15 12:32:16,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {608#(and (<= 1 main_~i~1) (<= main_~n~0 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-15 12:32:16,125 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-15 12:32:16,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-15 12:32:16,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-15 12:32:16,125 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-15 12:32:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:16,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:16,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {535#false} assume !false; {535#false} is VALID [2022-04-15 12:32:16,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {535#false} assume 0 == ~cond; {535#false} is VALID [2022-04-15 12:32:16,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {535#false} ~cond := #in~cond; {535#false} is VALID [2022-04-15 12:32:16,228 INFO L272 TraceCheckUtils]: 20: Hoare triple {535#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {535#false} is VALID [2022-04-15 12:32:16,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {535#false} is VALID [2022-04-15 12:32:16,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {547#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:16,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:16,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {534#true} {639#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:16,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 12:32:16,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {534#true} assume !(0 == ~cond); {534#true} is VALID [2022-04-15 12:32:16,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {534#true} ~cond := #in~cond; {534#true} is VALID [2022-04-15 12:32:16,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {534#true} is VALID [2022-04-15 12:32:16,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {639#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:16,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#(<= main_~n~0 1)} ~i~1 := 0; {639#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:16,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {540#(<= main_~i~0 1)} assume !(~i~0 < ~n~0); {541#(<= main_~n~0 1)} is VALID [2022-04-15 12:32:16,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {540#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:16,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {570#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:16,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {534#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {570#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:16,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {534#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {534#true} is VALID [2022-04-15 12:32:16,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {534#true} call #t~ret6 := main(); {534#true} is VALID [2022-04-15 12:32:16,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {534#true} {534#true} #70#return; {534#true} is VALID [2022-04-15 12:32:16,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {534#true} assume true; {534#true} is VALID [2022-04-15 12:32:16,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {534#true} is VALID [2022-04-15 12:32:16,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {534#true} call ULTIMATE.init(); {534#true} is VALID [2022-04-15 12:32:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:16,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754131058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:16,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:16,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-15 12:32:16,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:16,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [556621426] [2022-04-15 12:32:16,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [556621426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:16,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:16,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:32:16,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053353562] [2022-04-15 12:32:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:16,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 12:32:16,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:16,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:16,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:16,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:32:16,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:16,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:32:16,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:32:16,269 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:16,484 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-04-15 12:32:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:32:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-15 12:32:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 12:32:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 12:32:16,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 12:32:16,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:16,520 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:32:16,520 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 12:32:16,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:32:16,522 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:16,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 12:32:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-15 12:32:16,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:16,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:16,528 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:16,528 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:16,530 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 12:32:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 12:32:16,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:16,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:16,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 12:32:16,531 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-04-15 12:32:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:16,533 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-15 12:32:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-15 12:32:16,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:16,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:16,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:16,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-15 12:32:16,535 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2022-04-15 12:32:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:16,535 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-15 12:32:16,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:16,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-15 12:32:16,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:32:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:32:16,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:16,561 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:16,581 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-15 12:32:16,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 12:32:16,778 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:16,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:16,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 3 times [2022-04-15 12:32:16,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:16,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [518873363] [2022-04-15 12:32:16,781 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:16,781 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1936590556, now seen corresponding path program 4 times [2022-04-15 12:32:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:16,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668015895] [2022-04-15 12:32:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:16,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:16,934 INFO L290 TraceCheckUtils]: 0: Hoare triple {934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {916#true} is VALID [2022-04-15 12:32:16,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 12:32:16,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-15 12:32:16,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 12:32:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:16,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-15 12:32:16,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-15 12:32:16,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 12:32:16,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:16,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:16,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {916#true} is VALID [2022-04-15 12:32:16,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 12:32:16,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-15 12:32:16,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-15 12:32:16,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {916#true} is VALID [2022-04-15 12:32:16,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {921#(= main_~i~0 0)} is VALID [2022-04-15 12:32:16,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {921#(= main_~i~0 0)} is VALID [2022-04-15 12:32:16,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {921#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {922#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:16,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {923#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:16,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {923#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-15 12:32:16,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} assume !(~i~0 < ~n~0); {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} is VALID [2022-04-15 12:32:16,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {924#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0)} ~i~1 := 0; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:16,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:16,948 INFO L272 TraceCheckUtils]: 14: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {916#true} is VALID [2022-04-15 12:32:16,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {916#true} ~cond := #in~cond; {916#true} is VALID [2022-04-15 12:32:16,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {916#true} assume !(0 == ~cond); {916#true} is VALID [2022-04-15 12:32:16,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 12:32:16,949 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {916#true} {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #68#return; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:16,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} havoc #t~mem5; {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:16,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {925#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {930#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:16,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {930#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {931#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:16,951 INFO L272 TraceCheckUtils]: 22: Hoare triple {931#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {932#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:16,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {932#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {933#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:16,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {933#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {917#false} is VALID [2022-04-15 12:32:16,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-15 12:32:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:16,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668015895] [2022-04-15 12:32:16,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668015895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:16,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549518705] [2022-04-15 12:32:16,952 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:16,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:16,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:16,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:16,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:32:17,000 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:17,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:17,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:32:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:17,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:17,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:32:18,231 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:32:18,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:32:18,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {916#true} call ULTIMATE.init(); {916#true} is VALID [2022-04-15 12:32:18,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {916#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {916#true} is VALID [2022-04-15 12:32:18,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {916#true} assume true; {916#true} is VALID [2022-04-15 12:32:18,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {916#true} {916#true} #70#return; {916#true} is VALID [2022-04-15 12:32:18,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {916#true} call #t~ret6 := main(); {916#true} is VALID [2022-04-15 12:32:18,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-15 12:32:18,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {956#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:18,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {956#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:18,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {956#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {963#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:18,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {963#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {967#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1))} is VALID [2022-04-15 12:32:18,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {967#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {971#(exists ((v_main_~i~0_18 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1) (<= main_~i~0 (+ v_main_~i~0_18 1))))} is VALID [2022-04-15 12:32:18,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {971#(exists ((v_main_~i~0_18 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1) (<= main_~i~0 (+ v_main_~i~0_18 1))))} assume !(~i~0 < ~n~0); {975#(exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1)))} is VALID [2022-04-15 12:32:18,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {975#(exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1)))} ~i~1 := 0; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:18,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:18,329 INFO L272 TraceCheckUtils]: 14: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-15 12:32:18,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} ~cond := #in~cond; {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-15 12:32:18,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} assume !(0 == ~cond); {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-15 12:32:18,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} assume true; {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} is VALID [2022-04-15 12:32:18,330 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {986#(exists ((v_main_~i~0_18 Int) (v_main_~x~0.offset_BEFORE_CALL_1 Int) (v_main_~x~0.base_BEFORE_CALL_1 Int)) (and (<= v_main_~i~0_18 1) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_1) (+ (* v_main_~i~0_18 4) v_main_~x~0.offset_BEFORE_CALL_1)) 0)))} {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} #68#return; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:18,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} havoc #t~mem5; {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:18,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {979#(and (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1005#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))))} is VALID [2022-04-15 12:32:18,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {1005#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_18 Int)) (and (<= main_~n~0 (+ v_main_~i~0_18 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* v_main_~i~0_18 4) main_~x~0.offset)) 0) (<= v_main_~i~0_18 1))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {931#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:18,338 INFO L272 TraceCheckUtils]: 22: Hoare triple {931#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1012#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:32:18,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {1012#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1016#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:32:18,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {1016#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {917#false} is VALID [2022-04-15 12:32:18,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {917#false} assume !false; {917#false} is VALID [2022-04-15 12:32:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:18,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:18,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549518705] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:18,609 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:18,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-04-15 12:32:18,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:18,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [518873363] [2022-04-15 12:32:18,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [518873363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:18,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:18,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:32:18,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247446646] [2022-04-15 12:32:18,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:18,610 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 12:32:18,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:18,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:18,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:18,627 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:32:18,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:32:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:32:18,627 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:19,135 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2022-04-15 12:32:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:32:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-15 12:32:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 12:32:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-15 12:32:19,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-15 12:32:19,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-15 12:32:19,171 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:32:19,171 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:32:19,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:32:19,172 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:19,172 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 62 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:32:19,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:32:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-15 12:32:19,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:19,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:19,179 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:19,179 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:19,180 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 12:32:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 12:32:19,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:19,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:19,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-15 12:32:19,181 INFO L87 Difference]: Start difference. First operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-15 12:32:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:19,182 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 12:32:19,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 12:32:19,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:19,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:19,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:19,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-15 12:32:19,184 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 26 [2022-04-15 12:32:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:19,184 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-15 12:32:19,184 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:32:19,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-15 12:32:19,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 12:32:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:32:19,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:19,218 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:19,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:19,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:19,432 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:19,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:19,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 5 times [2022-04-15 12:32:19,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:19,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169708230] [2022-04-15 12:32:19,435 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:19,435 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1234500350, now seen corresponding path program 6 times [2022-04-15 12:32:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:19,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149225361] [2022-04-15 12:32:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:19,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:19,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {1326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1306#true} is VALID [2022-04-15 12:32:19,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-15 12:32:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 12:32:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:19,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 12:32:19,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 12:32:19,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #68#return; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 12:32:19,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 12:32:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:19,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 12:32:19,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 12:32:19,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:19,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1306#true} is VALID [2022-04-15 12:32:19,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-15 12:32:19,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-15 12:32:19,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-15 12:32:19,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1311#(= main_~i~0 0)} is VALID [2022-04-15 12:32:19,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {1311#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1311#(= main_~i~0 0)} is VALID [2022-04-15 12:32:19,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {1311#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:19,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:19,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:19,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-15 12:32:19,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 12:32:19,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 12:32:19,542 INFO L272 TraceCheckUtils]: 14: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 12:32:19,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 12:32:19,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 12:32:19,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,542 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #68#return; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 12:32:19,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} havoc #t~mem5; {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} is VALID [2022-04-15 12:32:19,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#(and (<= main_~n~0 2) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,544 INFO L272 TraceCheckUtils]: 22: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 12:32:19,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 12:32:19,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 12:32:19,544 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,544 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1325#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:19,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-15 12:32:19,545 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-15 12:32:19,546 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-15 12:32:19,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-15 12:32:19,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-15 12:32:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:32:19,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149225361] [2022-04-15 12:32:19,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149225361] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674143578] [2022-04-15 12:32:19,546 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:19,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:19,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:19,547 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:19,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:32:19,584 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 12:32:19,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:19,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:32:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:19,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:19,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-15 12:32:19,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1306#true} is VALID [2022-04-15 12:32:19,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-15 12:32:19,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-15 12:32:19,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-15 12:32:19,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1348#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:19,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:19,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {1348#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:19,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:19,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:19,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-15 12:32:19,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:19,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:19,816 INFO L272 TraceCheckUtils]: 14: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 12:32:19,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 12:32:19,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 12:32:19,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,817 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} #68#return; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:19,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} havoc #t~mem5; {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:19,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#(and (<= main_~n~0 2) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-15 12:32:19,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-15 12:32:19,818 INFO L272 TraceCheckUtils]: 22: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 12:32:19,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 12:32:19,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 12:32:19,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,819 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #68#return; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-15 12:32:19,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} havoc #t~mem5; {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} is VALID [2022-04-15 12:32:19,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {1392#(and (<= main_~n~0 2) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1417#(and (<= main_~n~0 2) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:19,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {1417#(and (<= main_~n~0 2) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-15 12:32:19,820 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-15 12:32:19,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-15 12:32:19,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-15 12:32:19,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-15 12:32:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:32:19,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:19,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {1307#false} assume !false; {1307#false} is VALID [2022-04-15 12:32:19,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {1307#false} assume 0 == ~cond; {1307#false} is VALID [2022-04-15 12:32:19,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {1307#false} ~cond := #in~cond; {1307#false} is VALID [2022-04-15 12:32:19,963 INFO L272 TraceCheckUtils]: 30: Hoare triple {1307#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1307#false} is VALID [2022-04-15 12:32:19,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {1325#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1307#false} is VALID [2022-04-15 12:32:19,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1325#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:19,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,964 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1306#true} {1320#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 12:32:19,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 12:32:19,965 INFO L272 TraceCheckUtils]: 22: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 12:32:19,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {1320#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1320#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:19,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:19,967 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1306#true} {1472#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:19,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {1306#true} assume !(0 == ~cond); {1306#true} is VALID [2022-04-15 12:32:19,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {1306#true} ~cond := #in~cond; {1306#true} is VALID [2022-04-15 12:32:19,967 INFO L272 TraceCheckUtils]: 14: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1306#true} is VALID [2022-04-15 12:32:19,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {1472#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:19,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {1314#(<= main_~n~0 2)} ~i~1 := 0; {1472#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:19,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(<= main_~i~0 2)} assume !(~i~0 < ~n~0); {1314#(<= main_~n~0 2)} is VALID [2022-04-15 12:32:19,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {1312#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1313#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:19,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1312#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:19,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {1348#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1312#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:19,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {1348#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:19,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1306#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1348#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:19,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1306#true} is VALID [2022-04-15 12:32:19,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1306#true} call #t~ret6 := main(); {1306#true} is VALID [2022-04-15 12:32:19,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1306#true} {1306#true} #70#return; {1306#true} is VALID [2022-04-15 12:32:19,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#true} assume true; {1306#true} is VALID [2022-04-15 12:32:19,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1306#true} is VALID [2022-04-15 12:32:19,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {1306#true} call ULTIMATE.init(); {1306#true} is VALID [2022-04-15 12:32:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:32:19,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674143578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:19,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:19,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2022-04-15 12:32:19,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:19,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169708230] [2022-04-15 12:32:19,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169708230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:19,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:19,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:32:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075524311] [2022-04-15 12:32:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-04-15 12:32:19,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:19,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:19,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:19,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:32:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:19,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:32:19,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:32:19,995 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:20,260 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 12:32:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:32:20,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2022-04-15 12:32:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-15 12:32:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-15 12:32:20,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-15 12:32:20,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:20,295 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:32:20,295 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 12:32:20,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:32:20,296 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:20,296 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 44 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:20,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 12:32:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-15 12:32:20,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:20,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:20,307 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:20,307 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:20,308 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 12:32:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 12:32:20,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:20,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:20,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-15 12:32:20,309 INFO L87 Difference]: Start difference. First operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-15 12:32:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:20,310 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 12:32:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 12:32:20,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:20,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:20,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:20,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-15 12:32:20,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-15 12:32:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:20,311 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-15 12:32:20,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:20,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-15 12:32:20,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 12:32:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 12:32:20,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:20,344 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:20,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:20,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:20,561 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:20,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:20,561 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 7 times [2022-04-15 12:32:20,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:20,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599314055] [2022-04-15 12:32:20,564 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:20,564 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:20,565 INFO L85 PathProgramCache]: Analyzing trace with hash -487899940, now seen corresponding path program 8 times [2022-04-15 12:32:20,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:20,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394756543] [2022-04-15 12:32:20,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:20,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:20,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {1851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1827#true} is VALID [2022-04-15 12:32:20,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 12:32:20,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-15 12:32:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:32:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:20,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-15 12:32:20,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-15 12:32:20,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 12:32:20,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 12:32:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:20,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-15 12:32:20,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-15 12:32:20,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 12:32:20,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:20,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {1827#true} call ULTIMATE.init(); {1851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:20,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1827#true} is VALID [2022-04-15 12:32:20,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 12:32:20,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-15 12:32:20,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-15 12:32:20,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1827#true} is VALID [2022-04-15 12:32:20,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1832#(= main_~i~0 0)} is VALID [2022-04-15 12:32:20,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {1832#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1832#(= main_~i~0 0)} is VALID [2022-04-15 12:32:20,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {1832#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:20,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:20,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {1833#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1834#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:20,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:20,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {1835#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-15 12:32:20,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} assume !(~i~0 < ~n~0); {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} is VALID [2022-04-15 12:32:20,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {1836#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0)} ~i~1 := 0; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:20,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:20,715 INFO L272 TraceCheckUtils]: 16: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1827#true} is VALID [2022-04-15 12:32:20,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-15 12:32:20,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-15 12:32:20,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 12:32:20,716 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1827#true} {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #68#return; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:20,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} havoc #t~mem5; {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:20,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {1837#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:20,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:20,717 INFO L272 TraceCheckUtils]: 24: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1827#true} is VALID [2022-04-15 12:32:20,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {1827#true} ~cond := #in~cond; {1827#true} is VALID [2022-04-15 12:32:20,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {1827#true} assume !(0 == ~cond); {1827#true} is VALID [2022-04-15 12:32:20,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 12:32:20,718 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1827#true} {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:20,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:20,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {1842#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:20,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {1847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1848#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:20,719 INFO L272 TraceCheckUtils]: 32: Hoare triple {1848#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1849#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:20,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {1849#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1850#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:20,720 INFO L290 TraceCheckUtils]: 34: Hoare triple {1850#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1828#false} is VALID [2022-04-15 12:32:20,720 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-15 12:32:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:32:20,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:20,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394756543] [2022-04-15 12:32:20,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394756543] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:20,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121541712] [2022-04-15 12:32:20,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:20,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:20,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:20,722 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:20,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:32:20,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:20,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:20,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:32:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:20,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:20,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:32:22,426 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:32:22,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:32:22,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {1827#true} call ULTIMATE.init(); {1827#true} is VALID [2022-04-15 12:32:22,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1827#true} is VALID [2022-04-15 12:32:22,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume true; {1827#true} is VALID [2022-04-15 12:32:22,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1827#true} {1827#true} #70#return; {1827#true} is VALID [2022-04-15 12:32:22,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {1827#true} call #t~ret6 := main(); {1827#true} is VALID [2022-04-15 12:32:22,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1827#true} is VALID [2022-04-15 12:32:22,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1873#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:22,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {1873#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1873#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:22,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {1873#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1880#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:22,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {1880#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1880#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:22,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {1880#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1887#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:22,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {1887#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {1891#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:22,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {1891#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1895#(exists ((v_main_~i~0_30 Int)) (and (<= main_~i~0 (+ v_main_~i~0_30 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2)))} is VALID [2022-04-15 12:32:22,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {1895#(exists ((v_main_~i~0_30 Int)) (and (<= main_~i~0 (+ v_main_~i~0_30 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2)))} assume !(~i~0 < ~n~0); {1899#(exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1))))} is VALID [2022-04-15 12:32:22,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {1899#(exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1))))} ~i~1 := 0; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 12:32:22,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 12:32:22,516 INFO L272 TraceCheckUtils]: 16: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 12:32:22,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} ~cond := #in~cond; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 12:32:22,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume !(0 == ~cond); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 12:32:22,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume true; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 12:32:22,518 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #68#return; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 12:32:22,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} havoc #t~mem5; {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 12:32:22,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {1903#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 12:32:22,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 12:32:22,522 INFO L272 TraceCheckUtils]: 24: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 12:32:22,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} ~cond := #in~cond; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 12:32:22,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume !(0 == ~cond); {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 12:32:22,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} assume true; {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} is VALID [2022-04-15 12:32:22,523 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1910#(exists ((v_main_~x~0.offset_BEFORE_CALL_2 Int) (v_main_~x~0.base_BEFORE_CALL_2 Int) (v_main_~i~0_30 Int)) (and (<= v_main_~i~0_30 2) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_2) (+ (* v_main_~i~0_30 4) v_main_~x~0.offset_BEFORE_CALL_2)) 0)))} {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #68#return; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 12:32:22,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} havoc #t~mem5; {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} is VALID [2022-04-15 12:32:22,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {1929#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {1954#(and (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:22,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {1954#(and (exists ((v_main_~i~0_30 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_30 4))) 0) (<= v_main_~i~0_30 2) (<= main_~n~0 (+ v_main_~i~0_30 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {1848#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:22,525 INFO L272 TraceCheckUtils]: 32: Hoare triple {1848#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:32:22,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {1961#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1965#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:32:22,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {1965#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1828#false} is VALID [2022-04-15 12:32:22,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-04-15 12:32:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 12:32:22,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:22,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121541712] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:22,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:22,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2022-04-15 12:32:22,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:22,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599314055] [2022-04-15 12:32:22,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599314055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:22,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:22,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:32:22,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65879869] [2022-04-15 12:32:22,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:22,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-15 12:32:22,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:22,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:22,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:22,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:32:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:32:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:32:22,824 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:23,525 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-04-15 12:32:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:32:23,525 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-15 12:32:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:23,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:23,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:32:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:32:23,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-15 12:32:23,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:23,566 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:32:23,566 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:32:23,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=1385, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:32:23,567 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:23,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 65 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:32:23,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:32:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-04-15 12:32:23,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:23,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:23,580 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:23,581 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:23,582 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 12:32:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 12:32:23,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:23,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:23,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-15 12:32:23,586 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-15 12:32:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:23,597 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 12:32:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 12:32:23,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:23,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:23,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:23,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-15 12:32:23,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 36 [2022-04-15 12:32:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:23,600 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-15 12:32:23,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:23,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-15 12:32:23,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:23,641 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 12:32:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:32:23,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:23,642 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:23,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:23,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:23,843 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:23,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:23,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 9 times [2022-04-15 12:32:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:23,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1450575120] [2022-04-15 12:32:23,854 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:23,854 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1322580298, now seen corresponding path program 10 times [2022-04-15 12:32:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:23,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237678407] [2022-04-15 12:32:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:23,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:24,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:24,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {2345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2319#true} is VALID [2022-04-15 12:32:24,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-15 12:32:24,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 12:32:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:24,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #68#return; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 12:32:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 12:32:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:24,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 12:32:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:24,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:24,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {2345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2319#true} is VALID [2022-04-15 12:32:24,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-15 12:32:24,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-15 12:32:24,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-15 12:32:24,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2324#(= main_~i~0 0)} is VALID [2022-04-15 12:32:24,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {2324#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2324#(= main_~i~0 0)} is VALID [2022-04-15 12:32:24,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {2324#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:24,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:24,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:24,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:24,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:24,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-15 12:32:24,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 12:32:24,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 12:32:24,047 INFO L272 TraceCheckUtils]: 16: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,048 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #68#return; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 12:32:24,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} havoc #t~mem5; {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} is VALID [2022-04-15 12:32:24,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {2329#(and (<= main_~n~0 3) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,049 INFO L290 TraceCheckUtils]: 23: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,049 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,050 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,051 INFO L272 TraceCheckUtils]: 32: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,052 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2344#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:24,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {2344#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-15 12:32:24,053 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-15 12:32:24,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-15 12:32:24,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-15 12:32:24,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-15 12:32:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:32:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:24,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237678407] [2022-04-15 12:32:24,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237678407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:24,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731541578] [2022-04-15 12:32:24,054 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:24,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:24,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:24,055 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:24,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:32:24,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:24,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:24,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:32:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:24,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:24,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-15 12:32:24,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2319#true} is VALID [2022-04-15 12:32:24,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-15 12:32:24,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-15 12:32:24,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-15 12:32:24,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2367#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:24,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2367#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:24,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:24,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:24,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:24,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:24,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:24,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-15 12:32:24,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,396 INFO L272 TraceCheckUtils]: 16: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,397 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} #68#return; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {2392#(and (<= 0 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,398 INFO L272 TraceCheckUtils]: 24: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,399 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} #68#return; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {2417#(and (<= 1 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,400 INFO L272 TraceCheckUtils]: 32: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,401 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} #68#return; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,401 INFO L290 TraceCheckUtils]: 37: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} havoc #t~mem5; {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {2442#(and (<= 2 main_~i~1) (<= main_~n~0 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2467#(and (<= 3 main_~i~1) (<= main_~n~0 3))} is VALID [2022-04-15 12:32:24,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {2467#(and (<= 3 main_~i~1) (<= main_~n~0 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-15 12:32:24,406 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-15 12:32:24,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-15 12:32:24,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-15 12:32:24,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-15 12:32:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:32:24,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:24,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {2320#false} assume !false; {2320#false} is VALID [2022-04-15 12:32:24,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {2320#false} assume 0 == ~cond; {2320#false} is VALID [2022-04-15 12:32:24,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {2320#false} ~cond := #in~cond; {2320#false} is VALID [2022-04-15 12:32:24,580 INFO L272 TraceCheckUtils]: 40: Hoare triple {2320#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2320#false} is VALID [2022-04-15 12:32:24,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {2344#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2320#false} is VALID [2022-04-15 12:32:24,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2344#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:24,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,582 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2319#true} {2339#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,582 INFO L272 TraceCheckUtils]: 32: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {2339#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2339#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:24,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,584 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2319#true} {2334#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,584 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {2334#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2334#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:24,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:24,586 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2319#true} {2546#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:24,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {2319#true} assume !(0 == ~cond); {2319#true} is VALID [2022-04-15 12:32:24,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {2319#true} ~cond := #in~cond; {2319#true} is VALID [2022-04-15 12:32:24,586 INFO L272 TraceCheckUtils]: 16: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2319#true} is VALID [2022-04-15 12:32:24,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {2546#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:24,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {2328#(<= main_~n~0 3)} ~i~1 := 0; {2546#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:24,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {2327#(<= main_~i~0 3)} assume !(~i~0 < ~n~0); {2328#(<= main_~n~0 3)} is VALID [2022-04-15 12:32:24,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {2326#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2327#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:24,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2326#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:24,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {2325#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2326#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:24,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2325#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:24,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2325#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:24,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2367#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:24,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {2319#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2367#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:24,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {2319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2319#true} is VALID [2022-04-15 12:32:24,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {2319#true} call #t~ret6 := main(); {2319#true} is VALID [2022-04-15 12:32:24,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2319#true} {2319#true} #70#return; {2319#true} is VALID [2022-04-15 12:32:24,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {2319#true} assume true; {2319#true} is VALID [2022-04-15 12:32:24,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2319#true} is VALID [2022-04-15 12:32:24,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {2319#true} call ULTIMATE.init(); {2319#true} is VALID [2022-04-15 12:32:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:32:24,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731541578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:24,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:24,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-04-15 12:32:24,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:24,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1450575120] [2022-04-15 12:32:24,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1450575120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:24,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:24,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:32:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957329127] [2022-04-15 12:32:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:24,591 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2022-04-15 12:32:24,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:24,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:24,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:24,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:32:24,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:24,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:32:24,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:32:24,616 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:25,020 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-04-15 12:32:25,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:32:25,020 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2022-04-15 12:32:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-15 12:32:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-15 12:32:25,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-15 12:32:25,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:25,066 INFO L225 Difference]: With dead ends: 74 [2022-04-15 12:32:25,066 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:32:25,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:32:25,067 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:25,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 51 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:32:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 12:32:25,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:25,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:25,100 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:25,100 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:25,101 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 12:32:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 12:32:25,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:25,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:25,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-15 12:32:25,102 INFO L87 Difference]: Start difference. First operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 50 states. [2022-04-15 12:32:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:25,103 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 12:32:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 12:32:25,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:25,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:25,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:25,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-15 12:32:25,104 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2022-04-15 12:32:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:25,105 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-15 12:32:25,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:25,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-15 12:32:25,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 12:32:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:32:25,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:25,154 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:25,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:25,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:25,363 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 11 times [2022-04-15 12:32:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:25,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2088435940] [2022-04-15 12:32:25,376 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:25,376 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1186401044, now seen corresponding path program 12 times [2022-04-15 12:32:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:25,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805237006] [2022-04-15 12:32:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:25,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:25,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {3009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2979#true} is VALID [2022-04-15 12:32:25,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:25,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-15 12:32:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 12:32:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:25,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 12:32:25,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 12:32:25,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:25,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 12:32:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:25,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 12:32:25,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 12:32:25,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:25,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 12:32:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:25,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 12:32:25,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 12:32:25,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:25,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:25,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {2979#true} call ULTIMATE.init(); {3009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:25,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {3009#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2979#true} is VALID [2022-04-15 12:32:25,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:25,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-15 12:32:25,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-15 12:32:25,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {2979#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2979#true} is VALID [2022-04-15 12:32:25,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {2979#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2984#(= main_~i~0 0)} is VALID [2022-04-15 12:32:25,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {2984#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2984#(= main_~i~0 0)} is VALID [2022-04-15 12:32:25,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {2984#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:25,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:25,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {2985#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:25,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:25,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {2986#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2987#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:25,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {2987#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {2988#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:25,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {2988#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-15 12:32:25,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} assume !(~i~0 < ~n~0); {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} is VALID [2022-04-15 12:32:25,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {2989#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0)} ~i~1 := 0; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:25,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:25,545 INFO L272 TraceCheckUtils]: 18: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-15 12:32:25,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 12:32:25,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 12:32:25,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:25,546 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2979#true} {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #68#return; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:25,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} havoc #t~mem5; {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:25,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {2990#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 12)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:25,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:25,547 INFO L272 TraceCheckUtils]: 26: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-15 12:32:25,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 12:32:25,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 12:32:25,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:25,548 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2979#true} {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:25,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:25,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {2995#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:25,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:25,549 INFO L272 TraceCheckUtils]: 34: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {2979#true} is VALID [2022-04-15 12:32:25,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {2979#true} ~cond := #in~cond; {2979#true} is VALID [2022-04-15 12:32:25,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {2979#true} assume !(0 == ~cond); {2979#true} is VALID [2022-04-15 12:32:25,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:25,550 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2979#true} {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:25,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:25,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {3000#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3005#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:25,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {3005#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3006#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:25,551 INFO L272 TraceCheckUtils]: 42: Hoare triple {3006#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:25,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {3007#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3008#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:25,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {3008#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2980#false} is VALID [2022-04-15 12:32:25,552 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-15 12:32:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:32:25,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:25,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805237006] [2022-04-15 12:32:25,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805237006] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:25,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700500015] [2022-04-15 12:32:25,553 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:25,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:25,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:25,554 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:25,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:32:25,599 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 12:32:25,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:25,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:32:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:25,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:25,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:32:28,167 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:32:28,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:32:28,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {2979#true} call ULTIMATE.init(); {2979#true} is VALID [2022-04-15 12:32:28,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {2979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2979#true} is VALID [2022-04-15 12:32:28,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {2979#true} assume true; {2979#true} is VALID [2022-04-15 12:32:28,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2979#true} {2979#true} #70#return; {2979#true} is VALID [2022-04-15 12:32:28,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {2979#true} call #t~ret6 := main(); {2979#true} is VALID [2022-04-15 12:32:28,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {2979#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {2979#true} is VALID [2022-04-15 12:32:28,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {2979#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3031#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:28,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {3031#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3031#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:28,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {3031#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3038#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:28,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {3038#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3038#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:28,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {3038#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3045#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:28,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {3045#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3045#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:28,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {3045#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3052#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:28,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {3052#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3056#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:28,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {3056#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3060#(exists ((v_main_~i~0_45 Int)) (and (<= main_~i~0 (+ v_main_~i~0_45 1)) (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0)))} is VALID [2022-04-15 12:32:28,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {3060#(exists ((v_main_~i~0_45 Int)) (and (<= main_~i~0 (+ v_main_~i~0_45 1)) (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0)))} assume !(~i~0 < ~n~0); {3064#(exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1))))} is VALID [2022-04-15 12:32:28,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {3064#(exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1))))} ~i~1 := 0; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 12:32:28,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 12:32:28,245 INFO L272 TraceCheckUtils]: 18: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,246 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #68#return; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 12:32:28,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} havoc #t~mem5; {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 12:32:28,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {3068#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 12:32:28,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 12:32:28,256 INFO L272 TraceCheckUtils]: 26: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,257 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #68#return; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 12:32:28,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} havoc #t~mem5; {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} is VALID [2022-04-15 12:32:28,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {3094#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:28,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:28,269 INFO L272 TraceCheckUtils]: 34: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} ~cond := #in~cond; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume !(0 == ~cond); {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} assume true; {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} is VALID [2022-04-15 12:32:28,270 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3075#(exists ((v_main_~x~0.base_BEFORE_CALL_4 Int) (v_main_~x~0.offset_BEFORE_CALL_4 Int) (v_main_~i~0_45 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_4) (+ (* v_main_~i~0_45 4) v_main_~x~0.offset_BEFORE_CALL_4)) 0) (<= v_main_~i~0_45 3)))} {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} #68#return; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:28,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:28,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {3119#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3144#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:28,272 INFO L290 TraceCheckUtils]: 41: Hoare triple {3144#(and (exists ((v_main_~i~0_45 Int)) (and (<= v_main_~i~0_45 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_45 4))) 0) (<= main_~n~0 (+ v_main_~i~0_45 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3006#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:28,273 INFO L272 TraceCheckUtils]: 42: Hoare triple {3006#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3151#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:32:28,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {3151#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3155#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:32:28,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {3155#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2980#false} is VALID [2022-04-15 12:32:28,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {2980#false} assume !false; {2980#false} is VALID [2022-04-15 12:32:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 12:32:28,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:28,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700500015] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:28,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:28,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2022-04-15 12:32:28,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:28,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2088435940] [2022-04-15 12:32:28,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2088435940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:28,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:28,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:32:28,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719936584] [2022-04-15 12:32:28,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-04-15 12:32:28,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:28,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:28,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:28,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:32:28,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:28,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:32:28,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:32:28,556 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:29,527 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-15 12:32:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:32:29,527 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-04-15 12:32:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-15 12:32:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 54 transitions. [2022-04-15 12:32:29,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 54 transitions. [2022-04-15 12:32:29,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:29,571 INFO L225 Difference]: With dead ends: 62 [2022-04-15 12:32:29,571 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 12:32:29,571 INFO L912 BasicCegarLoop]: 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-15 12:32:29,572 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:29,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 76 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:32:29,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 12:32:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-04-15 12:32:29,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:29,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:29,592 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:29,592 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:29,594 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 12:32:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-15 12:32:29,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:29,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:29,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 12:32:29,594 INFO L87 Difference]: Start difference. First operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 12:32:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:29,596 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 12:32:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-15 12:32:29,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:29,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:29,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:29,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 44 states have internal predecessors, (45), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-04-15 12:32:29,598 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2022-04-15 12:32:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:29,598 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-04-15 12:32:29,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:32:29,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 58 transitions. [2022-04-15 12:32:29,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-15 12:32:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 12:32:29,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:29,660 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:29,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:29,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:29,879 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:29,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 13 times [2022-04-15 12:32:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:29,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1598039264] [2022-04-15 12:32:29,881 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:29,882 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1707008786, now seen corresponding path program 14 times [2022-04-15 12:32:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:29,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692001618] [2022-04-15 12:32:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:30,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:30,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {3605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3573#true} is VALID [2022-04-15 12:32:30,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-15 12:32:30,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-15 12:32:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:30,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #68#return; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 12:32:30,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 12:32:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:30,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 12:32:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:30,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 12:32:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:30,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:30,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {3605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3573#true} is VALID [2022-04-15 12:32:30,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-15 12:32:30,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-15 12:32:30,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-15 12:32:30,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3578#(= main_~i~0 0)} is VALID [2022-04-15 12:32:30,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {3578#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3578#(= main_~i~0 0)} is VALID [2022-04-15 12:32:30,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {3578#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:30,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:30,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:30,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:30,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:30,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:30,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:30,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-15 12:32:30,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 12:32:30,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 12:32:30,061 INFO L272 TraceCheckUtils]: 18: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,062 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #68#return; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 12:32:30,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} havoc #t~mem5; {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} is VALID [2022-04-15 12:32:30,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {3584#(and (<= main_~n~0 4) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,063 INFO L272 TraceCheckUtils]: 26: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,064 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,065 INFO L272 TraceCheckUtils]: 34: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,065 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,066 INFO L272 TraceCheckUtils]: 42: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,067 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:30,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {3604#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-15 12:32:30,068 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-15 12:32:30,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-15 12:32:30,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-15 12:32:30,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-15 12:32:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 12:32:30,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:30,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692001618] [2022-04-15 12:32:30,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692001618] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:30,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744871691] [2022-04-15 12:32:30,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:30,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:30,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:30,070 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:30,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:32:30,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:30,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:30,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:32:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:30,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:30,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-15 12:32:30,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3573#true} is VALID [2022-04-15 12:32:30,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-15 12:32:30,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-15 12:32:30,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-15 12:32:30,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3627#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:30,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3627#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:30,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:30,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:30,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:30,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:30,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:30,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:30,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:30,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-15 12:32:30,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,503 INFO L272 TraceCheckUtils]: 18: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,504 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} #68#return; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {3658#(and (<= 0 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,506 INFO L272 TraceCheckUtils]: 26: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,506 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} #68#return; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {3683#(and (<= 1 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,508 INFO L272 TraceCheckUtils]: 34: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,508 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,508 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} #68#return; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {3708#(and (<= 2 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,509 INFO L290 TraceCheckUtils]: 41: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,510 INFO L272 TraceCheckUtils]: 42: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,510 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} #68#return; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} havoc #t~mem5; {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {3733#(and (<= 3 main_~i~1) (<= main_~n~0 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3758#(and (<= 4 main_~i~1) (<= main_~n~0 4))} is VALID [2022-04-15 12:32:30,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {3758#(and (<= 4 main_~i~1) (<= main_~n~0 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-15 12:32:30,512 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-15 12:32:30,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-15 12:32:30,512 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-15 12:32:30,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-15 12:32:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 12:32:30,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:30,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2022-04-15 12:32:30,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {3574#false} assume 0 == ~cond; {3574#false} is VALID [2022-04-15 12:32:30,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2022-04-15 12:32:30,766 INFO L272 TraceCheckUtils]: 50: Hoare triple {3574#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3574#false} is VALID [2022-04-15 12:32:30,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {3604#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3574#false} is VALID [2022-04-15 12:32:30,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3604#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:30,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,767 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3573#true} {3599#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,767 INFO L272 TraceCheckUtils]: 42: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {3599#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3599#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:30,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,769 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3573#true} {3594#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,769 INFO L272 TraceCheckUtils]: 34: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {3594#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3594#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:30,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,770 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3573#true} {3589#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,771 INFO L272 TraceCheckUtils]: 26: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {3589#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3589#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:30,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:30,772 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3573#true} {3861#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:30,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {3573#true} assume !(0 == ~cond); {3573#true} is VALID [2022-04-15 12:32:30,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {3573#true} ~cond := #in~cond; {3573#true} is VALID [2022-04-15 12:32:30,772 INFO L272 TraceCheckUtils]: 18: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {3573#true} is VALID [2022-04-15 12:32:30,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:30,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {3583#(<= main_~n~0 4)} ~i~1 := 0; {3861#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:30,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {3582#(<= main_~i~0 4)} assume !(~i~0 < ~n~0); {3583#(<= main_~n~0 4)} is VALID [2022-04-15 12:32:30,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {3581#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3582#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:30,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {3581#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3581#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:30,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {3580#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3581#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:30,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {3580#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3580#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:30,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {3579#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3580#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:30,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {3579#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3579#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:30,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {3627#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3579#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:30,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {3627#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {3627#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:30,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {3573#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {3627#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:30,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {3573#true} is VALID [2022-04-15 12:32:30,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret6 := main(); {3573#true} is VALID [2022-04-15 12:32:30,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #70#return; {3573#true} is VALID [2022-04-15 12:32:30,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2022-04-15 12:32:30,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3573#true} is VALID [2022-04-15 12:32:30,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2022-04-15 12:32:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 12:32:30,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744871691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:30,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:30,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 21 [2022-04-15 12:32:30,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:30,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1598039264] [2022-04-15 12:32:30,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1598039264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:30,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:30,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:32:30,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654848589] [2022-04-15 12:32:30,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:30,789 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2022-04-15 12:32:30,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:30,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:30,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:30,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:32:30,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:30,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:32:30,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:32:30,830 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:31,340 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-04-15 12:32:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:32:31,340 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2022-04-15 12:32:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-15 12:32:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 64 transitions. [2022-04-15 12:32:31,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 64 transitions. [2022-04-15 12:32:31,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:31,392 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:32:31,393 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 12:32:31,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:32:31,395 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:31,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 58 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:32:31,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 12:32:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-15 12:32:31,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:31,418 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:31,418 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:31,424 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:31,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:31,426 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 12:32:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-15 12:32:31,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:31,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:31,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 12:32:31,428 INFO L87 Difference]: Start difference. First operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 12:32:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:31,429 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 12:32:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-04-15 12:32:31,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:31,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:31,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:31,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 46 states have internal predecessors, (47), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-15 12:32:31,431 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2022-04-15 12:32:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:31,432 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-15 12:32:31,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:31,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-15 12:32:31,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:32:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 12:32:31,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:31,495 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:31,513 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-15 12:32:31,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 12:32:31,712 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:31,712 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 15 times [2022-04-15 12:32:31,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:31,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2141696678] [2022-04-15 12:32:31,714 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:31,714 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:31,714 INFO L85 PathProgramCache]: Analyzing trace with hash -275659828, now seen corresponding path program 16 times [2022-04-15 12:32:31,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:31,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654270106] [2022-04-15 12:32:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:31,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:31,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {4408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4372#true} is VALID [2022-04-15 12:32:31,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-15 12:32:31,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 12:32:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:31,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 12:32:31,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 12:32:31,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:31,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 12:32:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:31,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 12:32:31,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 12:32:31,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 12:32:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:31,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 12:32:31,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 12:32:31,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:31,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 12:32:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:31,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 12:32:31,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 12:32:31,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:31,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:31,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {4408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4372#true} is VALID [2022-04-15 12:32:31,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-15 12:32:31,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-15 12:32:31,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {4372#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4372#true} is VALID [2022-04-15 12:32:31,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {4372#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4377#(= main_~i~0 0)} is VALID [2022-04-15 12:32:31,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {4377#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4377#(= main_~i~0 0)} is VALID [2022-04-15 12:32:31,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {4377#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:31,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:31,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {4378#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:31,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:31,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {4379#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:31,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:31,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {4380#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4381#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:32:31,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {4381#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4382#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:32:31,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {4382#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-15 12:32:31,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} assume !(~i~0 < ~n~0); {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} is VALID [2022-04-15 12:32:31,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {4383#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0)} ~i~1 := 0; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:31,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:31,921 INFO L272 TraceCheckUtils]: 20: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-15 12:32:31,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 12:32:31,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 12:32:31,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,922 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4372#true} {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #68#return; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:31,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} havoc #t~mem5; {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:31,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {4384#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:31,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:31,923 INFO L272 TraceCheckUtils]: 28: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-15 12:32:31,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 12:32:31,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 12:32:31,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,924 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4372#true} {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:31,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:31,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {4389#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:31,925 INFO L290 TraceCheckUtils]: 35: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:31,925 INFO L272 TraceCheckUtils]: 36: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-15 12:32:31,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 12:32:31,925 INFO L290 TraceCheckUtils]: 38: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 12:32:31,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,926 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4372#true} {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:31,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:31,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {4394#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:31,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:31,927 INFO L272 TraceCheckUtils]: 44: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4372#true} is VALID [2022-04-15 12:32:31,927 INFO L290 TraceCheckUtils]: 45: Hoare triple {4372#true} ~cond := #in~cond; {4372#true} is VALID [2022-04-15 12:32:31,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {4372#true} assume !(0 == ~cond); {4372#true} is VALID [2022-04-15 12:32:31,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:31,928 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4372#true} {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:31,928 INFO L290 TraceCheckUtils]: 49: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:31,929 INFO L290 TraceCheckUtils]: 50: Hoare triple {4399#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4404#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:31,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {4404#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4405#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:31,929 INFO L272 TraceCheckUtils]: 52: Hoare triple {4405#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:31,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {4406#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4407#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:31,930 INFO L290 TraceCheckUtils]: 54: Hoare triple {4407#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4373#false} is VALID [2022-04-15 12:32:31,930 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-15 12:32:31,930 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 12:32:31,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:31,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654270106] [2022-04-15 12:32:31,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654270106] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:31,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036714042] [2022-04-15 12:32:31,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:31,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:31,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:31,932 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:31,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:32:31,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:31,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:31,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:32:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:32,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:32,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:32:36,961 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:32:36,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:32:37,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {4372#true} call ULTIMATE.init(); {4372#true} is VALID [2022-04-15 12:32:37,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {4372#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4372#true} is VALID [2022-04-15 12:32:37,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {4372#true} assume true; {4372#true} is VALID [2022-04-15 12:32:37,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4372#true} {4372#true} #70#return; {4372#true} is VALID [2022-04-15 12:32:37,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {4372#true} call #t~ret6 := main(); {4372#true} is VALID [2022-04-15 12:32:37,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {4372#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {4372#true} is VALID [2022-04-15 12:32:37,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {4372#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {4430#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:37,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {4430#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4430#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:37,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {4430#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4437#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:37,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {4437#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4437#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:37,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {4437#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4444#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:37,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {4444#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4444#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:37,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {4444#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4451#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:37,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {4451#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4451#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:37,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {4451#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4458#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:37,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {4458#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {4462#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4))} is VALID [2022-04-15 12:32:37,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {4462#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 4))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4466#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~i~0 (+ v_main_~i~0_63 1))))} is VALID [2022-04-15 12:32:37,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {4466#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~i~0 (+ v_main_~i~0_63 1))))} assume !(~i~0 < ~n~0); {4470#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1))))} is VALID [2022-04-15 12:32:37,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {4470#(exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1))))} ~i~1 := 0; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,072 INFO L272 TraceCheckUtils]: 20: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,074 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {4474#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,080 INFO L272 TraceCheckUtils]: 28: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,082 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {4500#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,090 INFO L272 TraceCheckUtils]: 36: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,092 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #68#return; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} havoc #t~mem5; {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {4525#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:37,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:37,100 INFO L272 TraceCheckUtils]: 44: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} ~cond := #in~cond; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume !(0 == ~cond); {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} assume true; {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} is VALID [2022-04-15 12:32:37,102 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4481#(exists ((v_main_~x~0.offset_BEFORE_CALL_7 Int) (v_main_~x~0.base_BEFORE_CALL_7 Int) (v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_7) (+ v_main_~x~0.offset_BEFORE_CALL_7 (* v_main_~i~0_63 4))) 0)))} {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} #68#return; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:37,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:37,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {4550#(and (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {4575#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} is VALID [2022-04-15 12:32:37,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {4575#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_63 Int)) (and (<= v_main_~i~0_63 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_63 4))) 0) (<= main_~n~0 (+ v_main_~i~0_63 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {4405#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:37,105 INFO L272 TraceCheckUtils]: 52: Hoare triple {4405#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {4582#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:32:37,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {4582#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4586#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:32:37,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {4586#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4373#false} is VALID [2022-04-15 12:32:37,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {4373#false} assume !false; {4373#false} is VALID [2022-04-15 12:32:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 12:32:37,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036714042] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:37,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:37,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2022-04-15 12:32:37,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:37,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2141696678] [2022-04-15 12:32:37,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2141696678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:37,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:37,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:32:37,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047479051] [2022-04-15 12:32:37,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:37,691 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 56 [2022-04-15 12:32:37,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:37,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:37,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:37,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:32:37,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:37,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:32:37,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:32:37,729 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:38,972 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-04-15 12:32:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:32:38,973 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 56 [2022-04-15 12:32:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-15 12:32:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2022-04-15 12:32:38,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 61 transitions. [2022-04-15 12:32:39,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:39,026 INFO L225 Difference]: With dead ends: 72 [2022-04-15 12:32:39,026 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 12:32:39,027 INFO L912 BasicCegarLoop]: 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-15 12:32:39,027 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:39,027 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 87 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:32:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 12:32:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-04-15 12:32:39,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:39,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:39,046 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:39,046 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:39,047 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 12:32:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 12:32:39,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:39,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:39,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-15 12:32:39,048 INFO L87 Difference]: Start difference. First operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-15 12:32:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:39,049 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 12:32:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 12:32:39,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:39,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:39,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:39,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 52 states have internal predecessors, (53), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-15 12:32:39,051 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 56 [2022-04-15 12:32:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:39,051 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-15 12:32:39,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 12:32:39,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-15 12:32:39,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-15 12:32:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 12:32:39,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:39,129 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:39,148 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-15 12:32:39,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 12:32:39,330 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:39,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 17 times [2022-04-15 12:32:39,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:39,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [594208537] [2022-04-15 12:32:39,333 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:39,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1978425946, now seen corresponding path program 18 times [2022-04-15 12:32:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:39,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285142992] [2022-04-15 12:32:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {5106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5068#true} is VALID [2022-04-15 12:32:39,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,474 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-15 12:32:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 12:32:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #68#return; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 12:32:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 12:32:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:39,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 12:32:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 12:32:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 12:32:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:39,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:39,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {5106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5068#true} is VALID [2022-04-15 12:32:39,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-15 12:32:39,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-15 12:32:39,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-15 12:32:39,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5073#(= main_~i~0 0)} is VALID [2022-04-15 12:32:39,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {5073#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5073#(= main_~i~0 0)} is VALID [2022-04-15 12:32:39,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {5073#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:39,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:39,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:39,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:39,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:39,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:39,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:39,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:39,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:39,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-15 12:32:39,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 12:32:39,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 12:32:39,502 INFO L272 TraceCheckUtils]: 20: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:39,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,503 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #68#return; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 12:32:39,503 INFO L290 TraceCheckUtils]: 25: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} havoc #t~mem5; {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} is VALID [2022-04-15 12:32:39,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {5080#(and (<= main_~n~0 5) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:39,504 INFO L290 TraceCheckUtils]: 27: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:39,504 INFO L272 TraceCheckUtils]: 28: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:39,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,504 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:39,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:39,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:39,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:39,506 INFO L272 TraceCheckUtils]: 36: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:39,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,506 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:39,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:39,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:39,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:39,507 INFO L272 TraceCheckUtils]: 44: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:39,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,507 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,508 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,508 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:39,508 INFO L290 TraceCheckUtils]: 49: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:39,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:39,509 INFO L290 TraceCheckUtils]: 51: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:39,509 INFO L272 TraceCheckUtils]: 52: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:39,509 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:39,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:39,509 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:39,510 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:39,510 INFO L290 TraceCheckUtils]: 57: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:39,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5105#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:39,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {5105#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-15 12:32:39,511 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-15 12:32:39,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-15 12:32:39,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-15 12:32:39,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-15 12:32:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 43 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 12:32:39,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:39,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285142992] [2022-04-15 12:32:39,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285142992] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:39,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648609587] [2022-04-15 12:32:39,511 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:39,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:39,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:39,528 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:39,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:32:39,604 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 12:32:39,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:39,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:32:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:40,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-15 12:32:40,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5068#true} is VALID [2022-04-15 12:32:40,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-15 12:32:40,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-15 12:32:40,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-15 12:32:40,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5128#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:40,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {5128#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5128#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:40,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {5128#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:40,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:40,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:40,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:40,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:40,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:40,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:40,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:40,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:40,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-15 12:32:40,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,089 INFO L272 TraceCheckUtils]: 20: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,089 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} #68#return; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} havoc #t~mem5; {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {5165#(and (<= 0 main_~i~1) (<= main_~n~0 5))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,091 INFO L272 TraceCheckUtils]: 28: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,091 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} #68#return; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} havoc #t~mem5; {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {5190#(and (<= 1 main_~i~1) (<= main_~n~0 5))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:40,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:40,093 INFO L272 TraceCheckUtils]: 36: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,093 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,093 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} #68#return; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:40,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} havoc #t~mem5; {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:40,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {5215#(and (<= main_~n~0 5) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:40,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:40,094 INFO L272 TraceCheckUtils]: 44: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,095 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,095 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} #68#return; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:40,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} havoc #t~mem5; {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:40,096 INFO L290 TraceCheckUtils]: 50: Hoare triple {5240#(and (<= main_~n~0 5) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:40,096 INFO L290 TraceCheckUtils]: 51: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:40,096 INFO L272 TraceCheckUtils]: 52: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,096 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,097 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} #68#return; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:40,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} havoc #t~mem5; {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:40,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {5265#(and (<= main_~n~0 5) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5290#(and (<= 5 main_~i~1) (<= main_~n~0 5))} is VALID [2022-04-15 12:32:40,098 INFO L290 TraceCheckUtils]: 59: Hoare triple {5290#(and (<= 5 main_~i~1) (<= main_~n~0 5))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-15 12:32:40,098 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-15 12:32:40,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-15 12:32:40,098 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-15 12:32:40,098 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-15 12:32:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 12:32:40,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:40,366 INFO L290 TraceCheckUtils]: 63: Hoare triple {5069#false} assume !false; {5069#false} is VALID [2022-04-15 12:32:40,366 INFO L290 TraceCheckUtils]: 62: Hoare triple {5069#false} assume 0 == ~cond; {5069#false} is VALID [2022-04-15 12:32:40,366 INFO L290 TraceCheckUtils]: 61: Hoare triple {5069#false} ~cond := #in~cond; {5069#false} is VALID [2022-04-15 12:32:40,366 INFO L272 TraceCheckUtils]: 60: Hoare triple {5069#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5069#false} is VALID [2022-04-15 12:32:40,367 INFO L290 TraceCheckUtils]: 59: Hoare triple {5105#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5069#false} is VALID [2022-04-15 12:32:40,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5105#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:40,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:40,368 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5068#true} {5100#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:40,368 INFO L290 TraceCheckUtils]: 55: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,368 INFO L290 TraceCheckUtils]: 53: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,368 INFO L272 TraceCheckUtils]: 52: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {5100#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:40,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5100#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:40,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:40,370 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5068#true} {5095#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:40,370 INFO L290 TraceCheckUtils]: 47: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,370 INFO L272 TraceCheckUtils]: 44: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {5095#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:40,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5095#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:40,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:40,371 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5068#true} {5090#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:40,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,372 INFO L272 TraceCheckUtils]: 36: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {5090#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:40,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5090#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:40,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:40,373 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5068#true} {5085#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:40,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,373 INFO L272 TraceCheckUtils]: 28: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {5085#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:40,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {5085#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:40,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:40,375 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5068#true} {5417#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:40,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {5068#true} assume !(0 == ~cond); {5068#true} is VALID [2022-04-15 12:32:40,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {5068#true} ~cond := #in~cond; {5068#true} is VALID [2022-04-15 12:32:40,375 INFO L272 TraceCheckUtils]: 20: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {5068#true} is VALID [2022-04-15 12:32:40,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {5417#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:40,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= main_~n~0 5)} ~i~1 := 0; {5417#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:40,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= main_~i~0 5)} assume !(~i~0 < ~n~0); {5079#(<= main_~n~0 5)} is VALID [2022-04-15 12:32:40,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5078#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:40,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {5077#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5077#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:40,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {5076#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5077#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:40,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {5076#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5076#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:40,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {5075#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5076#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:40,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {5075#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5075#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:40,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {5074#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5075#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:40,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {5074#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5074#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:40,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {5128#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5074#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:40,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {5128#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {5128#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:40,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {5068#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {5128#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:40,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {5068#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {5068#true} is VALID [2022-04-15 12:32:40,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {5068#true} call #t~ret6 := main(); {5068#true} is VALID [2022-04-15 12:32:40,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5068#true} {5068#true} #70#return; {5068#true} is VALID [2022-04-15 12:32:40,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {5068#true} assume true; {5068#true} is VALID [2022-04-15 12:32:40,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {5068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5068#true} is VALID [2022-04-15 12:32:40,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {5068#true} call ULTIMATE.init(); {5068#true} is VALID [2022-04-15 12:32:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 60 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 12:32:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648609587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:40,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:40,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 24 [2022-04-15 12:32:40,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:40,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [594208537] [2022-04-15 12:32:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [594208537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:40,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:40,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:32:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735322572] [2022-04-15 12:32:40,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:40,382 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-04-15 12:32:40,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:40,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:40,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:40,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:32:40,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:40,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:32:40,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:32:40,415 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:40,995 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-15 12:32:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:32:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-04-15 12:32:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-15 12:32:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-15 12:32:40,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-15 12:32:41,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:41,050 INFO L225 Difference]: With dead ends: 102 [2022-04-15 12:32:41,050 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 12:32:41,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=262, Invalid=1070, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:32:41,051 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:41,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:32:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 12:32:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-15 12:32:41,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:41,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:41,074 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:41,074 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:41,075 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 12:32:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 12:32:41,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:41,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:41,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-15 12:32:41,075 INFO L87 Difference]: Start difference. First operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 70 states. [2022-04-15 12:32:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:41,076 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-04-15 12:32:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 12:32:41,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:41,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:41,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:41,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 54 states have internal predecessors, (55), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-04-15 12:32:41,078 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 64 [2022-04-15 12:32:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:41,078 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-04-15 12:32:41,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:41,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 70 transitions. [2022-04-15 12:32:41,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 12:32:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 12:32:41,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:41,154 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:41,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:41,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 12:32:41,355 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 19 times [2022-04-15 12:32:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:41,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [465157980] [2022-04-15 12:32:41,358 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:41,358 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash -442513660, now seen corresponding path program 20 times [2022-04-15 12:32:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:41,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041985108] [2022-04-15 12:32:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {6048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6006#true} is VALID [2022-04-15 12:32:41,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-15 12:32:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 12:32:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 12:32:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,594 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 12:32:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:41,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 12:32:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 12:32:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:41,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:41,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {6048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6006#true} is VALID [2022-04-15 12:32:41,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-15 12:32:41,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-15 12:32:41,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {6006#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6006#true} is VALID [2022-04-15 12:32:41,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {6006#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6011#(= main_~i~0 0)} is VALID [2022-04-15 12:32:41,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {6011#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6011#(= main_~i~0 0)} is VALID [2022-04-15 12:32:41,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {6011#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:41,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:41,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {6012#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:41,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:41,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {6013#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:41,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:41,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {6014#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:32:41,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:32:41,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {6015#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6016#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:32:41,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {6016#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6017#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:32:41,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {6017#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-15 12:32:41,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} assume !(~i~0 < ~n~0); {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} is VALID [2022-04-15 12:32:41,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {6018#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0)} ~i~1 := 0; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:41,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:41,611 INFO L272 TraceCheckUtils]: 22: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 12:32:41,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,612 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6006#true} {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #68#return; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:41,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} havoc #t~mem5; {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:32:41,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {6019#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 20)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:41,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:41,613 INFO L272 TraceCheckUtils]: 30: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 12:32:41,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,614 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6006#true} {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:41,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:41,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {6024#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:41,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:41,616 INFO L272 TraceCheckUtils]: 38: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 12:32:41,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,617 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6006#true} {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:41,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:41,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {6029#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:41,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:41,618 INFO L272 TraceCheckUtils]: 46: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 12:32:41,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,619 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6006#true} {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:41,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:41,620 INFO L290 TraceCheckUtils]: 52: Hoare triple {6034#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:41,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:41,620 INFO L272 TraceCheckUtils]: 54: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6006#true} is VALID [2022-04-15 12:32:41,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {6006#true} ~cond := #in~cond; {6006#true} is VALID [2022-04-15 12:32:41,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {6006#true} assume !(0 == ~cond); {6006#true} is VALID [2022-04-15 12:32:41,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:41,621 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6006#true} {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:41,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:41,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {6039#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6044#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:41,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {6044#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6045#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:41,623 INFO L272 TraceCheckUtils]: 62: Hoare triple {6045#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6046#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:41,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {6046#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6047#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:41,624 INFO L290 TraceCheckUtils]: 64: Hoare triple {6047#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6007#false} is VALID [2022-04-15 12:32:41,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-15 12:32:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 86 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 12:32:41,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041985108] [2022-04-15 12:32:41,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041985108] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228304648] [2022-04-15 12:32:41,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:41,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:41,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:41,625 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:41,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:32:41,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:41,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:41,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:32:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:41,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:32:46,116 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:32:46,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:32:46,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2022-04-15 12:32:46,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {6006#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6006#true} is VALID [2022-04-15 12:32:46,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2022-04-15 12:32:46,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #70#return; {6006#true} is VALID [2022-04-15 12:32:46,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret6 := main(); {6006#true} is VALID [2022-04-15 12:32:46,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {6006#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6006#true} is VALID [2022-04-15 12:32:46,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {6006#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6070#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:46,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6070#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:46,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6077#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:46,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {6077#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6077#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:46,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {6077#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6084#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:46,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {6084#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6084#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:46,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {6084#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6091#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:46,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6091#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:46,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6098#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:46,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {6098#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6098#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:46,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {6098#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6105#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:46,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {6105#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6109#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5))} is VALID [2022-04-15 12:32:46,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {6109#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 5))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6113#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~i~0 (+ v_main_~i~0_84 1))))} is VALID [2022-04-15 12:32:46,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {6113#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~i~0 (+ v_main_~i~0_84 1))))} assume !(~i~0 < ~n~0); {6117#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1))))} is VALID [2022-04-15 12:32:46,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {6117#(exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1))))} ~i~1 := 0; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 12:32:46,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 12:32:46,217 INFO L272 TraceCheckUtils]: 22: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,219 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #68#return; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 12:32:46,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} havoc #t~mem5; {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 12:32:46,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {6121#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 12:32:46,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 12:32:46,225 INFO L272 TraceCheckUtils]: 30: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,227 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #68#return; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 12:32:46,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} havoc #t~mem5; {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} is VALID [2022-04-15 12:32:46,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {6147#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:46,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:46,232 INFO L272 TraceCheckUtils]: 38: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,234 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} #68#return; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:46,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:46,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {6172#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:46,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:46,239 INFO L272 TraceCheckUtils]: 46: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,240 INFO L290 TraceCheckUtils]: 47: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,240 INFO L290 TraceCheckUtils]: 49: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,241 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} #68#return; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:46,242 INFO L290 TraceCheckUtils]: 51: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} havoc #t~mem5; {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:46,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {6197#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:46,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:46,246 INFO L272 TraceCheckUtils]: 54: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,246 INFO L290 TraceCheckUtils]: 55: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} ~cond := #in~cond; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume !(0 == ~cond); {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} assume true; {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} is VALID [2022-04-15 12:32:46,247 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6128#(exists ((v_main_~x~0.base_BEFORE_CALL_11 Int) (v_main_~x~0.offset_BEFORE_CALL_11 Int) (v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_11) (+ (* v_main_~i~0_84 4) v_main_~x~0.offset_BEFORE_CALL_11)) 0)))} {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} #68#return; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:46,248 INFO L290 TraceCheckUtils]: 59: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} havoc #t~mem5; {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:46,249 INFO L290 TraceCheckUtils]: 60: Hoare triple {6222#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6247#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:46,249 INFO L290 TraceCheckUtils]: 61: Hoare triple {6247#(and (exists ((v_main_~i~0_84 Int)) (and (<= v_main_~i~0_84 5) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* v_main_~i~0_84 4))) 0) (<= main_~n~0 (+ v_main_~i~0_84 1)))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6045#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:46,250 INFO L272 TraceCheckUtils]: 62: Hoare triple {6045#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:32:46,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {6254#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6258#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:32:46,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {6258#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6007#false} is VALID [2022-04-15 12:32:46,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2022-04-15 12:32:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 45 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 12:32:46,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:46,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228304648] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:46,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:46,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2022-04-15 12:32:46,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:46,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [465157980] [2022-04-15 12:32:46,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [465157980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:46,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:46,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:32:46,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101109002] [2022-04-15 12:32:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:46,527 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-04-15 12:32:46,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:46,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:46,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:46,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:32:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:32:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 12:32:46,563 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:48,110 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-04-15 12:32:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:32:48,110 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2022-04-15 12:32:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-15 12:32:48,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-15 12:32:48,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2022-04-15 12:32:48,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:48,187 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:32:48,188 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 12:32:48,188 INFO L912 BasicCegarLoop]: 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-15 12:32:48,189 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:48,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 98 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:32:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 12:32:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-15 12:32:48,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:48,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:32:48,214 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:32:48,214 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:32:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:48,215 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:32:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 12:32:48,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:48,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:48,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-15 12:32:48,216 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-15 12:32:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:48,217 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:32:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 12:32:48,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:48,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:48,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:48,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 60 states have internal predecessors, (61), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:32:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-04-15 12:32:48,218 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 66 [2022-04-15 12:32:48,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:48,219 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-04-15 12:32:48,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 12:32:48,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 78 transitions. [2022-04-15 12:32:48,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 12:32:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 12:32:48,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:48,322 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:48,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:48,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 12:32:48,538 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:48,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 21 times [2022-04-15 12:32:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:48,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977516115] [2022-04-15 12:32:48,541 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:48,541 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:48,541 INFO L85 PathProgramCache]: Analyzing trace with hash -832116514, now seen corresponding path program 22 times [2022-04-15 12:32:48,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:48,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147079680] [2022-04-15 12:32:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {6848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6804#true} is VALID [2022-04-15 12:32:48,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-15 12:32:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 12:32:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,702 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #68#return; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 12:32:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 12:32:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 12:32:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 12:32:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 12:32:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 12:32:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:48,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:48,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {6848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6804#true} is VALID [2022-04-15 12:32:48,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-15 12:32:48,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-15 12:32:48,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-15 12:32:48,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6809#(= main_~i~0 0)} is VALID [2022-04-15 12:32:48,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6809#(= main_~i~0 0)} is VALID [2022-04-15 12:32:48,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:48,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:48,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:48,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:48,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:48,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:48,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:48,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:48,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:48,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:48,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-15 12:32:48,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-15 12:32:48,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 12:32:48,745 INFO L290 TraceCheckUtils]: 21: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 12:32:48,745 INFO L272 TraceCheckUtils]: 22: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:48,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,746 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #68#return; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 12:32:48,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} havoc #t~mem5; {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} is VALID [2022-04-15 12:32:48,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {6817#(and (<= main_~n~0 6) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:48,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:48,747 INFO L272 TraceCheckUtils]: 30: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:48,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,748 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:48,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:48,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:48,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:48,749 INFO L272 TraceCheckUtils]: 38: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:48,749 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,749 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,750 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:48,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:48,750 INFO L290 TraceCheckUtils]: 44: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:48,751 INFO L290 TraceCheckUtils]: 45: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:48,751 INFO L272 TraceCheckUtils]: 46: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:48,751 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,751 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:48,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:48,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:48,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:48,752 INFO L272 TraceCheckUtils]: 54: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:48,753 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,753 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:48,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:48,754 INFO L290 TraceCheckUtils]: 60: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:48,754 INFO L290 TraceCheckUtils]: 61: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:48,754 INFO L272 TraceCheckUtils]: 62: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:48,754 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:48,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:48,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:48,755 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:48,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:48,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6847#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:48,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {6847#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-15 12:32:48,756 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-15 12:32:48,756 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-15 12:32:48,756 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-15 12:32:48,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-15 12:32:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 63 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 12:32:48,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:48,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147079680] [2022-04-15 12:32:48,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147079680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:48,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847924635] [2022-04-15 12:32:48,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:48,758 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:48,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:32:48,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:48,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:48,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:32:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:48,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:49,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-15 12:32:49,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6804#true} is VALID [2022-04-15 12:32:49,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-15 12:32:49,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-15 12:32:49,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-15 12:32:49,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6870#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:49,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {6870#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6870#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:49,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {6870#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:49,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:49,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:49,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:49,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:49,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:49,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:49,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:49,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:49,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:49,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-15 12:32:49,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-15 12:32:49,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:49,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:49,345 INFO L272 TraceCheckUtils]: 22: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,345 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} #68#return; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:49,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} havoc #t~mem5; {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:49,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {6913#(and (<= main_~n~0 6) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-15 12:32:49,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-15 12:32:49,347 INFO L272 TraceCheckUtils]: 30: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,347 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,347 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,347 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} #68#return; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-15 12:32:49,348 INFO L290 TraceCheckUtils]: 35: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} havoc #t~mem5; {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} is VALID [2022-04-15 12:32:49,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {6938#(and (<= main_~n~0 6) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:49,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:49,348 INFO L272 TraceCheckUtils]: 38: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,349 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,349 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} #68#return; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:49,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} havoc #t~mem5; {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:49,350 INFO L290 TraceCheckUtils]: 44: Hoare triple {6963#(and (<= main_~n~0 6) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:49,350 INFO L290 TraceCheckUtils]: 45: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:49,350 INFO L272 TraceCheckUtils]: 46: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,351 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,351 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} #68#return; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:49,351 INFO L290 TraceCheckUtils]: 51: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} havoc #t~mem5; {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:49,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {6988#(and (<= main_~n~0 6) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:49,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:49,352 INFO L272 TraceCheckUtils]: 54: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,352 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,352 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,353 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} #68#return; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:49,353 INFO L290 TraceCheckUtils]: 59: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} havoc #t~mem5; {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:49,354 INFO L290 TraceCheckUtils]: 60: Hoare triple {7013#(and (<= main_~n~0 6) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:49,354 INFO L290 TraceCheckUtils]: 61: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:49,354 INFO L272 TraceCheckUtils]: 62: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,354 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,354 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,354 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,355 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} #68#return; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:49,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} havoc #t~mem5; {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:49,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {7038#(and (<= main_~n~0 6) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7063#(and (<= main_~n~0 6) (<= 6 main_~i~1))} is VALID [2022-04-15 12:32:49,356 INFO L290 TraceCheckUtils]: 69: Hoare triple {7063#(and (<= main_~n~0 6) (<= 6 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-15 12:32:49,356 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-15 12:32:49,356 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-15 12:32:49,356 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-15 12:32:49,356 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-15 12:32:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 12:32:49,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:49,675 INFO L290 TraceCheckUtils]: 73: Hoare triple {6805#false} assume !false; {6805#false} is VALID [2022-04-15 12:32:49,675 INFO L290 TraceCheckUtils]: 72: Hoare triple {6805#false} assume 0 == ~cond; {6805#false} is VALID [2022-04-15 12:32:49,675 INFO L290 TraceCheckUtils]: 71: Hoare triple {6805#false} ~cond := #in~cond; {6805#false} is VALID [2022-04-15 12:32:49,675 INFO L272 TraceCheckUtils]: 70: Hoare triple {6805#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6805#false} is VALID [2022-04-15 12:32:49,675 INFO L290 TraceCheckUtils]: 69: Hoare triple {6847#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6805#false} is VALID [2022-04-15 12:32:49,676 INFO L290 TraceCheckUtils]: 68: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6847#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:49,676 INFO L290 TraceCheckUtils]: 67: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:49,676 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {6804#true} {6842#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:49,677 INFO L290 TraceCheckUtils]: 65: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,677 INFO L290 TraceCheckUtils]: 64: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,677 INFO L290 TraceCheckUtils]: 63: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,677 INFO L272 TraceCheckUtils]: 62: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,677 INFO L290 TraceCheckUtils]: 61: Hoare triple {6842#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:49,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6842#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:49,678 INFO L290 TraceCheckUtils]: 59: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:49,678 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {6804#true} {6837#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:49,678 INFO L290 TraceCheckUtils]: 57: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,678 INFO L290 TraceCheckUtils]: 56: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,679 INFO L272 TraceCheckUtils]: 54: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,679 INFO L290 TraceCheckUtils]: 53: Hoare triple {6837#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:49,679 INFO L290 TraceCheckUtils]: 52: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6837#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:49,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:49,680 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6804#true} {6832#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:49,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,680 INFO L272 TraceCheckUtils]: 46: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,681 INFO L290 TraceCheckUtils]: 45: Hoare triple {6832#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:49,681 INFO L290 TraceCheckUtils]: 44: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6832#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:49,681 INFO L290 TraceCheckUtils]: 43: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:49,682 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6804#true} {6827#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:49,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,682 INFO L272 TraceCheckUtils]: 38: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {6827#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:49,683 INFO L290 TraceCheckUtils]: 36: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6827#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:49,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:49,684 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6804#true} {6822#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:49,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,684 INFO L272 TraceCheckUtils]: 30: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {6822#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:49,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {6822#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:49,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:49,685 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {6804#true} {7214#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:49,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {6804#true} assume !(0 == ~cond); {6804#true} is VALID [2022-04-15 12:32:49,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {6804#true} ~cond := #in~cond; {6804#true} is VALID [2022-04-15 12:32:49,686 INFO L272 TraceCheckUtils]: 22: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {6804#true} is VALID [2022-04-15 12:32:49,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {7214#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:49,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(<= main_~n~0 6)} ~i~1 := 0; {7214#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:49,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {6815#(<= main_~i~0 6)} assume !(~i~0 < ~n~0); {6816#(<= main_~n~0 6)} is VALID [2022-04-15 12:32:49,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6815#(<= main_~i~0 6)} is VALID [2022-04-15 12:32:49,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6814#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:49,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {6813#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6814#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:49,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {6813#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6813#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:49,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {6812#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6813#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:49,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {6812#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6812#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:49,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {6811#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6812#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:49,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {6811#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6811#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:49,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {6810#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6811#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:49,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {6810#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6810#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:49,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {6870#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6810#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:49,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {6870#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {6870#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:49,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {6804#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {6870#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:49,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {6804#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {6804#true} is VALID [2022-04-15 12:32:49,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {6804#true} call #t~ret6 := main(); {6804#true} is VALID [2022-04-15 12:32:49,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6804#true} {6804#true} #70#return; {6804#true} is VALID [2022-04-15 12:32:49,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {6804#true} assume true; {6804#true} is VALID [2022-04-15 12:32:49,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {6804#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6804#true} is VALID [2022-04-15 12:32:49,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {6804#true} call ULTIMATE.init(); {6804#true} is VALID [2022-04-15 12:32:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 12:32:49,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847924635] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:49,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:49,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 27 [2022-04-15 12:32:49,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:49,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [977516115] [2022-04-15 12:32:49,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [977516115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:49,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:49,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:32:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992323304] [2022-04-15 12:32:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:49,693 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 74 [2022-04-15 12:32:49,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:49,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:49,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:49,729 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:32:49,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:49,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:32:49,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:32:49,730 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:50,438 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-04-15 12:32:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:32:50,439 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 74 [2022-04-15 12:32:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-15 12:32:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-15 12:32:50,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2022-04-15 12:32:50,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:50,498 INFO L225 Difference]: With dead ends: 116 [2022-04-15 12:32:50,499 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 12:32:50,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=1392, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:32:50,500 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:50,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 62 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:32:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 12:32:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-15 12:32:50,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:50,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:32:50,530 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:32:50,530 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:32:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:50,531 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:32:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 12:32:50,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:50,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:50,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-15 12:32:50,532 INFO L87 Difference]: Start difference. First operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 80 states. [2022-04-15 12:32:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:50,533 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:32:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 12:32:50,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:50,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:50,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:50,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 62 states have internal predecessors, (63), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:32:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-15 12:32:50,534 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-15 12:32:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:50,534 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-15 12:32:50,535 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:50,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-15 12:32:50,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 12:32:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 12:32:50,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:50,632 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:50,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:50,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 12:32:50,841 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:50,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 23 times [2022-04-15 12:32:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:50,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325335241] [2022-04-15 12:32:50,844 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:50,844 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2005759164, now seen corresponding path program 24 times [2022-04-15 12:32:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:50,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309578770] [2022-04-15 12:32:50,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {7929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7881#true} is VALID [2022-04-15 12:32:51,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-15 12:32:51,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 12:32:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 12:32:51,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 12:32:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:32:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 12:32:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 12:32:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 12:32:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:51,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 12:32:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:51,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {7881#true} call ULTIMATE.init(); {7929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:51,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7881#true} is VALID [2022-04-15 12:32:51,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-15 12:32:51,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-15 12:32:51,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {7881#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7881#true} is VALID [2022-04-15 12:32:51,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {7881#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7886#(= main_~i~0 0)} is VALID [2022-04-15 12:32:51,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {7886#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7886#(= main_~i~0 0)} is VALID [2022-04-15 12:32:51,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {7886#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:51,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:32:51,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {7887#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:51,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:32:51,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {7888#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:51,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:32:51,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {7889#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:32:51,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:32:51,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {7890#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:32:51,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:32:51,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {7891#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7892#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:32:51,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {7892#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7893#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:32:51,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {7893#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-15 12:32:51,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} assume !(~i~0 < ~n~0); {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} is VALID [2022-04-15 12:32:51,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {7894#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0)} ~i~1 := 0; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 12:32:51,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 12:32:51,144 INFO L272 TraceCheckUtils]: 24: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 12:32:51,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,145 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7881#true} {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #68#return; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 12:32:51,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} havoc #t~mem5; {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} is VALID [2022-04-15 12:32:51,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {7895#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 24)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:32:51,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:32:51,146 INFO L272 TraceCheckUtils]: 32: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 12:32:51,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,147 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7881#true} {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:32:51,147 INFO L290 TraceCheckUtils]: 37: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:32:51,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {7900#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:51,148 INFO L290 TraceCheckUtils]: 39: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:51,148 INFO L272 TraceCheckUtils]: 40: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 12:32:51,149 INFO L290 TraceCheckUtils]: 41: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,149 INFO L290 TraceCheckUtils]: 42: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,149 INFO L290 TraceCheckUtils]: 43: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,149 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {7881#true} {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:51,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:51,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {7905#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:51,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:51,151 INFO L272 TraceCheckUtils]: 48: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 12:32:51,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,151 INFO L290 TraceCheckUtils]: 50: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,151 INFO L290 TraceCheckUtils]: 51: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,152 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7881#true} {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:51,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:32:51,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {7910#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:51,153 INFO L290 TraceCheckUtils]: 55: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:51,153 INFO L272 TraceCheckUtils]: 56: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 12:32:51,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,154 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7881#true} {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:51,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:32:51,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {7915#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:51,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:51,155 INFO L272 TraceCheckUtils]: 64: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7881#true} is VALID [2022-04-15 12:32:51,155 INFO L290 TraceCheckUtils]: 65: Hoare triple {7881#true} ~cond := #in~cond; {7881#true} is VALID [2022-04-15 12:32:51,155 INFO L290 TraceCheckUtils]: 66: Hoare triple {7881#true} assume !(0 == ~cond); {7881#true} is VALID [2022-04-15 12:32:51,155 INFO L290 TraceCheckUtils]: 67: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:51,156 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7881#true} {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:51,156 INFO L290 TraceCheckUtils]: 69: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:32:51,157 INFO L290 TraceCheckUtils]: 70: Hoare triple {7920#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {7925#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:32:51,157 INFO L290 TraceCheckUtils]: 71: Hoare triple {7925#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7926#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:51,157 INFO L272 TraceCheckUtils]: 72: Hoare triple {7926#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {7927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:51,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {7927#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7928#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:51,158 INFO L290 TraceCheckUtils]: 74: Hoare triple {7928#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7882#false} is VALID [2022-04-15 12:32:51,158 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-15 12:32:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 121 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 12:32:51,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309578770] [2022-04-15 12:32:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309578770] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139375574] [2022-04-15 12:32:51,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:51,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:51,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:51,160 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:51,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:32:51,229 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 12:32:51,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:51,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 12:32:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:51,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:51,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:32:56,239 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:32:56,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:32:56,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {7881#true} call ULTIMATE.init(); {7881#true} is VALID [2022-04-15 12:32:56,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {7881#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7881#true} is VALID [2022-04-15 12:32:56,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {7881#true} assume true; {7881#true} is VALID [2022-04-15 12:32:56,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7881#true} {7881#true} #70#return; {7881#true} is VALID [2022-04-15 12:32:56,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {7881#true} call #t~ret6 := main(); {7881#true} is VALID [2022-04-15 12:32:56,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {7881#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {7881#true} is VALID [2022-04-15 12:32:56,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {7881#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {7951#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:56,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {7951#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7951#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:56,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {7951#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7958#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:56,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {7958#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7958#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:56,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {7958#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7965#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:56,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {7965#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7965#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:56,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {7965#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7972#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:56,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {7972#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7972#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:56,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {7972#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7979#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:56,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {7979#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7979#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:56,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {7979#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7986#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:56,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {7986#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7986#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:56,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {7986#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7993#(<= main_~i~0 6)} is VALID [2022-04-15 12:32:56,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {7993#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {7997#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6))} is VALID [2022-04-15 12:32:56,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {7997#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 6))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8001#(exists ((v_main_~i~0_108 Int)) (and (<= main_~i~0 (+ v_main_~i~0_108 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= v_main_~i~0_108 6)))} is VALID [2022-04-15 12:32:56,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {8001#(exists ((v_main_~i~0_108 Int)) (and (<= main_~i~0 (+ v_main_~i~0_108 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= v_main_~i~0_108 6)))} assume !(~i~0 < ~n~0); {8005#(exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6)))} is VALID [2022-04-15 12:32:56,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {8005#(exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6)))} ~i~1 := 0; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:56,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:56,336 INFO L272 TraceCheckUtils]: 24: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,341 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} #68#return; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:56,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} havoc #t~mem5; {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:32:56,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {8009#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 12:32:56,342 INFO L290 TraceCheckUtils]: 31: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 12:32:56,359 INFO L272 TraceCheckUtils]: 32: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,364 INFO L290 TraceCheckUtils]: 35: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,364 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} #68#return; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 12:32:56,364 INFO L290 TraceCheckUtils]: 37: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} havoc #t~mem5; {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 12:32:56,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {8035#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:56,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:56,370 INFO L272 TraceCheckUtils]: 40: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,386 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} #68#return; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:56,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} havoc #t~mem5; {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:32:56,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {8060#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:56,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:56,391 INFO L272 TraceCheckUtils]: 48: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,393 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} #68#return; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:56,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} havoc #t~mem5; {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:32:56,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {8085#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:56,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:56,397 INFO L272 TraceCheckUtils]: 56: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,402 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} #68#return; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:56,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} havoc #t~mem5; {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:32:56,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {8110#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:56,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:56,411 INFO L272 TraceCheckUtils]: 64: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} ~cond := #in~cond; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,416 INFO L290 TraceCheckUtils]: 66: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume !(0 == ~cond); {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,416 INFO L290 TraceCheckUtils]: 67: Hoare triple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} assume true; {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} is VALID [2022-04-15 12:32:56,417 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8016#(exists ((v_main_~x~0.base_BEFORE_CALL_16 Int) (v_main_~x~0.offset_BEFORE_CALL_16 Int) (v_main_~i~0_108 Int)) (and (<= v_main_~i~0_108 6) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_16) (+ (* 4 v_main_~i~0_108) v_main_~x~0.offset_BEFORE_CALL_16)) 0)))} {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} #68#return; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:56,417 INFO L290 TraceCheckUtils]: 69: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} havoc #t~mem5; {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:32:56,418 INFO L290 TraceCheckUtils]: 70: Hoare triple {8135#(and (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8160#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} is VALID [2022-04-15 12:32:56,418 INFO L290 TraceCheckUtils]: 71: Hoare triple {8160#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_108 Int)) (and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_108))) 0) (<= main_~n~0 (+ v_main_~i~0_108 1)) (<= v_main_~i~0_108 6))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {7926#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:32:56,419 INFO L272 TraceCheckUtils]: 72: Hoare triple {7926#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8167#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:32:56,419 INFO L290 TraceCheckUtils]: 73: Hoare triple {8167#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8171#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:32:56,419 INFO L290 TraceCheckUtils]: 74: Hoare triple {8171#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7882#false} is VALID [2022-04-15 12:32:56,419 INFO L290 TraceCheckUtils]: 75: Hoare triple {7882#false} assume !false; {7882#false} is VALID [2022-04-15 12:32:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 66 proven. 67 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 12:32:56,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:56,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139375574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:56,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:32:56,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-04-15 12:32:56,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:56,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325335241] [2022-04-15 12:32:56,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325335241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:56,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:56,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:32:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230523850] [2022-04-15 12:32:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:56,634 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 76 [2022-04-15 12:32:56,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:56,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:56,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:56,663 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:32:56,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:56,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:32:56,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:32:56,664 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:58,737 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-15 12:32:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:32:58,737 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 76 [2022-04-15 12:32:58,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-15 12:32:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-15 12:32:58,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-15 12:32:58,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:58,814 INFO L225 Difference]: With dead ends: 92 [2022-04-15 12:32:58,814 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 12:32:58,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=3689, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:32:58,816 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:58,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 113 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:32:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 12:32:58,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-04-15 12:32:58,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:58,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:32:58,855 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:32:58,855 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:32:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:58,857 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 12:32:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-15 12:32:58,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:58,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:58,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-15 12:32:58,857 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-15 12:32:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:58,861 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 12:32:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-15 12:32:58,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:58,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:58,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:58,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 68 states have internal predecessors, (69), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:32:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-15 12:32:58,863 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 76 [2022-04-15 12:32:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:58,863 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-15 12:32:58,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 12:32:58,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-15 12:32:58,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:58,982 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-15 12:32:58,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 12:32:58,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:58,983 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:59,000 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-15 12:32:59,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 12:32:59,184 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 25 times [2022-04-15 12:32:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:59,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1207459552] [2022-04-15 12:32:59,187 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:32:59,187 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:32:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -209232234, now seen corresponding path program 26 times [2022-04-15 12:32:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:59,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074794105] [2022-04-15 12:32:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:59,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {8831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8781#true} is VALID [2022-04-15 12:32:59,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-15 12:32:59,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-15 12:32:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #68#return; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 12:32:59,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 12:32:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:59,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 12:32:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:59,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 12:32:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:59,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 12:32:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 12:32:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 12:32:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:59,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:59,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {8831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8781#true} is VALID [2022-04-15 12:32:59,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-15 12:32:59,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-15 12:32:59,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-15 12:32:59,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8786#(= main_~i~0 0)} is VALID [2022-04-15 12:32:59,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {8786#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8786#(= main_~i~0 0)} is VALID [2022-04-15 12:32:59,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {8786#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:59,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-15 12:32:59,410 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:59,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-15 12:32:59,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:59,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-15 12:32:59,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:59,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-15 12:32:59,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:59,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-15 12:32:59,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-15 12:32:59,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-15 12:32:59,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-15 12:32:59,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-15 12:32:59,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 12:32:59,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 12:32:59,414 INFO L272 TraceCheckUtils]: 24: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:32:59,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,415 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #68#return; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 12:32:59,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} havoc #t~mem5; {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} is VALID [2022-04-15 12:32:59,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {8795#(and (<= main_~n~0 7) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:59,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:59,416 INFO L272 TraceCheckUtils]: 32: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:32:59,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,417 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:59,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:32:59,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:59,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:59,418 INFO L272 TraceCheckUtils]: 40: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:32:59,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,418 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,419 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:59,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:32:59,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:59,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:59,420 INFO L272 TraceCheckUtils]: 48: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:32:59,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,421 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:59,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:32:59,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:59,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:59,422 INFO L272 TraceCheckUtils]: 56: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:32:59,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,423 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:59,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:32:59,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:59,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:59,424 INFO L272 TraceCheckUtils]: 64: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:32:59,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,425 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:59,425 INFO L290 TraceCheckUtils]: 69: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:32:59,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:59,426 INFO L290 TraceCheckUtils]: 71: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:59,426 INFO L272 TraceCheckUtils]: 72: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:32:59,426 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:32:59,426 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:32:59,426 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:32:59,427 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:59,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:32:59,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8830#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:32:59,428 INFO L290 TraceCheckUtils]: 79: Hoare triple {8830#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-15 12:32:59,428 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-15 12:32:59,428 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 12:32:59,428 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 12:32:59,428 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 12:32:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 87 proven. 74 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 12:32:59,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:59,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074794105] [2022-04-15 12:32:59,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074794105] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:59,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299667533] [2022-04-15 12:32:59,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:59,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:59,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:59,430 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:59,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:32:59,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:59,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:59,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:32:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:59,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:00,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-15 12:33:00,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8781#true} is VALID [2022-04-15 12:33:00,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-15 12:33:00,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-15 12:33:00,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-15 12:33:00,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8853#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:00,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {8853#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8853#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:00,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {8853#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:00,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:00,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:00,135 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:00,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:00,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:00,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:00,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:00,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:00,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:00,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:00,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:00,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:00,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-15 12:33:00,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,139 INFO L272 TraceCheckUtils]: 24: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,140 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} #68#return; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {8902#(and (<= 0 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,141 INFO L272 TraceCheckUtils]: 32: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,142 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} #68#return; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,143 INFO L290 TraceCheckUtils]: 38: Hoare triple {8927#(and (<= 1 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-15 12:33:00,143 INFO L290 TraceCheckUtils]: 39: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-15 12:33:00,143 INFO L272 TraceCheckUtils]: 40: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,144 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} #68#return; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-15 12:33:00,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} havoc #t~mem5; {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} is VALID [2022-04-15 12:33:00,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {8952#(and (<= main_~n~0 7) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-15 12:33:00,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-15 12:33:00,145 INFO L272 TraceCheckUtils]: 48: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,145 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,146 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} #68#return; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-15 12:33:00,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} havoc #t~mem5; {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} is VALID [2022-04-15 12:33:00,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {8977#(and (<= main_~n~0 7) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-15 12:33:00,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-15 12:33:00,147 INFO L272 TraceCheckUtils]: 56: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,147 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,148 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,148 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,148 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} #68#return; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-15 12:33:00,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} havoc #t~mem5; {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} is VALID [2022-04-15 12:33:00,149 INFO L290 TraceCheckUtils]: 62: Hoare triple {9002#(and (<= main_~n~0 7) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,149 INFO L290 TraceCheckUtils]: 63: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,149 INFO L272 TraceCheckUtils]: 64: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,150 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,150 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,150 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,150 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} #68#return; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,150 INFO L290 TraceCheckUtils]: 69: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,151 INFO L290 TraceCheckUtils]: 70: Hoare triple {9027#(and (<= 5 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,151 INFO L290 TraceCheckUtils]: 71: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,151 INFO L272 TraceCheckUtils]: 72: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,152 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,152 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} #68#return; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,153 INFO L290 TraceCheckUtils]: 77: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} havoc #t~mem5; {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,153 INFO L290 TraceCheckUtils]: 78: Hoare triple {9052#(and (<= 6 main_~i~1) (<= main_~n~0 7))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {9077#(and (<= 7 main_~i~1) (<= main_~n~0 7))} is VALID [2022-04-15 12:33:00,153 INFO L290 TraceCheckUtils]: 79: Hoare triple {9077#(and (<= 7 main_~i~1) (<= main_~n~0 7))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-15 12:33:00,154 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-15 12:33:00,154 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 12:33:00,154 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 12:33:00,154 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 12:33:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 12:33:00,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:00,477 INFO L290 TraceCheckUtils]: 83: Hoare triple {8782#false} assume !false; {8782#false} is VALID [2022-04-15 12:33:00,478 INFO L290 TraceCheckUtils]: 82: Hoare triple {8782#false} assume 0 == ~cond; {8782#false} is VALID [2022-04-15 12:33:00,478 INFO L290 TraceCheckUtils]: 81: Hoare triple {8782#false} ~cond := #in~cond; {8782#false} is VALID [2022-04-15 12:33:00,478 INFO L272 TraceCheckUtils]: 80: Hoare triple {8782#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8782#false} is VALID [2022-04-15 12:33:00,478 INFO L290 TraceCheckUtils]: 79: Hoare triple {8830#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8782#false} is VALID [2022-04-15 12:33:00,478 INFO L290 TraceCheckUtils]: 78: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8830#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:33:00,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:00,479 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {8781#true} {8825#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:00,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,479 INFO L290 TraceCheckUtils]: 73: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,479 INFO L272 TraceCheckUtils]: 72: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {8825#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:00,480 INFO L290 TraceCheckUtils]: 70: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8825#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:00,480 INFO L290 TraceCheckUtils]: 69: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:00,481 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8781#true} {8820#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:00,481 INFO L290 TraceCheckUtils]: 67: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,481 INFO L290 TraceCheckUtils]: 66: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,481 INFO L290 TraceCheckUtils]: 65: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,481 INFO L272 TraceCheckUtils]: 64: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,481 INFO L290 TraceCheckUtils]: 63: Hoare triple {8820#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:00,482 INFO L290 TraceCheckUtils]: 62: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8820#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:00,482 INFO L290 TraceCheckUtils]: 61: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:00,482 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8781#true} {8815#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:00,482 INFO L290 TraceCheckUtils]: 59: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,483 INFO L272 TraceCheckUtils]: 56: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {8815#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:00,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8815#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:00,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:00,484 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {8781#true} {8810#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:00,484 INFO L290 TraceCheckUtils]: 51: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,484 INFO L290 TraceCheckUtils]: 50: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,484 INFO L272 TraceCheckUtils]: 48: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,485 INFO L290 TraceCheckUtils]: 47: Hoare triple {8810#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:00,485 INFO L290 TraceCheckUtils]: 46: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8810#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:00,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:00,486 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {8781#true} {8805#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:00,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,486 INFO L272 TraceCheckUtils]: 40: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {8805#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:00,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8805#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:00,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:00,487 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8781#true} {8800#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:00,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,487 INFO L272 TraceCheckUtils]: 32: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {8800#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:00,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {8800#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:00,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:00,489 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8781#true} {9252#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:00,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {8781#true} assume !(0 == ~cond); {8781#true} is VALID [2022-04-15 12:33:00,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {8781#true} ~cond := #in~cond; {8781#true} is VALID [2022-04-15 12:33:00,489 INFO L272 TraceCheckUtils]: 24: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {8781#true} is VALID [2022-04-15 12:33:00,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {9252#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:00,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {8794#(<= main_~n~0 7)} ~i~1 := 0; {9252#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:00,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {8793#(<= main_~i~0 7)} assume !(~i~0 < ~n~0); {8794#(<= main_~n~0 7)} is VALID [2022-04-15 12:33:00,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {8792#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8793#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:00,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {8792#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8792#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:00,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {8791#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8792#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:00,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {8791#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8791#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:00,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {8790#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8791#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:00,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {8790#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8790#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:00,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {8789#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8790#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:00,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {8789#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8789#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:00,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {8788#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8789#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:00,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {8788#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8788#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:00,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {8787#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8788#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:00,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {8787#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8787#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:00,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {8853#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8787#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:00,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {8853#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {8853#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:00,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {8781#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {8853#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:00,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {8781#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {8781#true} is VALID [2022-04-15 12:33:00,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {8781#true} call #t~ret6 := main(); {8781#true} is VALID [2022-04-15 12:33:00,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8781#true} {8781#true} #70#return; {8781#true} is VALID [2022-04-15 12:33:00,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {8781#true} assume true; {8781#true} is VALID [2022-04-15 12:33:00,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {8781#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8781#true} is VALID [2022-04-15 12:33:00,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {8781#true} call ULTIMATE.init(); {8781#true} is VALID [2022-04-15 12:33:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 112 proven. 49 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 12:33:00,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299667533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:00,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:33:00,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 30 [2022-04-15 12:33:00,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:00,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1207459552] [2022-04-15 12:33:00,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1207459552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:00,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:00,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:33:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594254087] [2022-04-15 12:33:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:00,510 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 84 [2022-04-15 12:33:00,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:00,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:00,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:00,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:33:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:33:00,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:33:00,553 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:01,302 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-04-15 12:33:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:33:01,302 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 84 [2022-04-15 12:33:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-15 12:33:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-15 12:33:01,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-15 12:33:01,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:01,381 INFO L225 Difference]: With dead ends: 130 [2022-04-15 12:33:01,381 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 12:33:01,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1756, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:33:01,383 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:01,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 49 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:33:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 12:33:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-04-15 12:33:01,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:01,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:01,431 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:01,431 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:01,432 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 12:33:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-15 12:33:01,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:01,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:01,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-15 12:33:01,433 INFO L87 Difference]: Start difference. First operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 90 states. [2022-04-15 12:33:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:01,434 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-04-15 12:33:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-04-15 12:33:01,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:01,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:01,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:01,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.0289855072463767) internal successors, (71), 70 states have internal predecessors, (71), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-04-15 12:33:01,436 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2022-04-15 12:33:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:01,436 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-04-15 12:33:01,436 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:01,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 90 transitions. [2022-04-15 12:33:01,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:33:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 12:33:01,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:01,574 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:01,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:01,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:01,775 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 27 times [2022-04-15 12:33:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:01,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1352152617] [2022-04-15 12:33:01,777 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:33:01,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:33:01,778 INFO L85 PathProgramCache]: Analyzing trace with hash 814689524, now seen corresponding path program 28 times [2022-04-15 12:33:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:01,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935894478] [2022-04-15 12:33:01,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:01,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {10051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9997#true} is VALID [2022-04-15 12:33:02,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-15 12:33:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 12:33:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:02,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 12:33:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 12:33:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 12:33:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:02,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 12:33:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 12:33:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 12:33:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:02,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {10051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:02,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {10051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9997#true} is VALID [2022-04-15 12:33:02,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-15 12:33:02,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-15 12:33:02,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9997#true} is VALID [2022-04-15 12:33:02,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {9997#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10002#(= main_~i~0 0)} is VALID [2022-04-15 12:33:02,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {10002#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10002#(= main_~i~0 0)} is VALID [2022-04-15 12:33:02,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {10002#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:33:02,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:33:02,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {10003#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:33:02,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:33:02,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {10004#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:33:02,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:33:02,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {10005#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:33:02,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:33:02,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {10006#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:33:02,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:33:02,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {10007#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:33:02,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:33:02,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {10008#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10009#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:33:02,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10010#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} is VALID [2022-04-15 12:33:02,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {10010#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-15 12:33:02,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} assume !(~i~0 < ~n~0); {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} is VALID [2022-04-15 12:33:02,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {10011#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0)} ~i~1 := 0; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:02,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:02,123 INFO L272 TraceCheckUtils]: 26: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 12:33:02,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,124 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9997#true} {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #68#return; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:02,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} havoc #t~mem5; {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:02,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {10012#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 28)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:02,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:02,125 INFO L272 TraceCheckUtils]: 34: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 12:33:02,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,126 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9997#true} {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:02,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:02,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {10017#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:02,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:02,127 INFO L272 TraceCheckUtils]: 42: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 12:33:02,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,127 INFO L290 TraceCheckUtils]: 44: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,128 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9997#true} {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:02,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:02,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {10022#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:02,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:02,129 INFO L272 TraceCheckUtils]: 50: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 12:33:02,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,130 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {9997#true} {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:02,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:02,131 INFO L290 TraceCheckUtils]: 56: Hoare triple {10027#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:02,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:02,131 INFO L272 TraceCheckUtils]: 58: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 12:33:02,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,132 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,132 INFO L290 TraceCheckUtils]: 61: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,132 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9997#true} {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:02,133 INFO L290 TraceCheckUtils]: 63: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:02,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {10032#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:02,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:02,134 INFO L272 TraceCheckUtils]: 66: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 12:33:02,134 INFO L290 TraceCheckUtils]: 67: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,134 INFO L290 TraceCheckUtils]: 68: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,134 INFO L290 TraceCheckUtils]: 69: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,134 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {9997#true} {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:02,135 INFO L290 TraceCheckUtils]: 71: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:02,135 INFO L290 TraceCheckUtils]: 72: Hoare triple {10037#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:02,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:02,136 INFO L272 TraceCheckUtils]: 74: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {9997#true} is VALID [2022-04-15 12:33:02,136 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#true} ~cond := #in~cond; {9997#true} is VALID [2022-04-15 12:33:02,136 INFO L290 TraceCheckUtils]: 76: Hoare triple {9997#true} assume !(0 == ~cond); {9997#true} is VALID [2022-04-15 12:33:02,136 INFO L290 TraceCheckUtils]: 77: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:02,136 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {9997#true} {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:02,137 INFO L290 TraceCheckUtils]: 79: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:02,137 INFO L290 TraceCheckUtils]: 80: Hoare triple {10042#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10047#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:02,138 INFO L290 TraceCheckUtils]: 81: Hoare triple {10047#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10048#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:33:02,138 INFO L272 TraceCheckUtils]: 82: Hoare triple {10048#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10049#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:33:02,138 INFO L290 TraceCheckUtils]: 83: Hoare triple {10049#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10050#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:33:02,139 INFO L290 TraceCheckUtils]: 84: Hoare triple {10050#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9998#false} is VALID [2022-04-15 12:33:02,139 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-15 12:33:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 14 proven. 162 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 12:33:02,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:02,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935894478] [2022-04-15 12:33:02,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935894478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:02,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511462543] [2022-04-15 12:33:02,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:33:02,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:02,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:02,160 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:02,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:33:02,264 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:33:02,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:02,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:33:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:02,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:33:08,462 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:33:08,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:33:08,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {9997#true} call ULTIMATE.init(); {9997#true} is VALID [2022-04-15 12:33:08,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {9997#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9997#true} is VALID [2022-04-15 12:33:08,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {9997#true} assume true; {9997#true} is VALID [2022-04-15 12:33:08,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9997#true} {9997#true} #70#return; {9997#true} is VALID [2022-04-15 12:33:08,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {9997#true} call #t~ret6 := main(); {9997#true} is VALID [2022-04-15 12:33:08,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {9997#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {9997#true} is VALID [2022-04-15 12:33:08,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {9997#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {10073#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:08,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {10073#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10073#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:08,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {10073#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10080#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:08,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {10080#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10080#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:08,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {10080#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10087#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:08,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {10087#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10087#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:08,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {10087#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10094#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:08,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {10094#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10094#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:08,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {10094#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10101#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:08,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {10101#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10101#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:08,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {10101#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10108#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:08,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {10108#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10108#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:08,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {10108#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10115#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:08,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {10115#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10115#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:08,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {10115#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10122#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:08,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {10122#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {10126#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-15 12:33:08,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {10126#(and (<= main_~i~0 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10130#(exists ((v_main_~i~0_135 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0) (<= main_~i~0 (+ v_main_~i~0_135 1))))} is VALID [2022-04-15 12:33:08,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {10130#(exists ((v_main_~i~0_135 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0) (<= main_~i~0 (+ v_main_~i~0_135 1))))} assume !(~i~0 < ~n~0); {10134#(exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0)))} is VALID [2022-04-15 12:33:08,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {10134#(exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0)))} ~i~1 := 0; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,552 INFO L272 TraceCheckUtils]: 26: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,554 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {10138#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,556 INFO L272 TraceCheckUtils]: 34: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,558 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {10164#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,560 INFO L272 TraceCheckUtils]: 42: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,561 INFO L290 TraceCheckUtils]: 43: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,561 INFO L290 TraceCheckUtils]: 44: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,562 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {10189#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,564 INFO L272 TraceCheckUtils]: 50: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,565 INFO L290 TraceCheckUtils]: 51: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,566 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,567 INFO L290 TraceCheckUtils]: 56: Hoare triple {10214#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,568 INFO L290 TraceCheckUtils]: 57: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,569 INFO L272 TraceCheckUtils]: 58: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,570 INFO L290 TraceCheckUtils]: 61: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,571 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,571 INFO L290 TraceCheckUtils]: 63: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {10239#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,585 INFO L272 TraceCheckUtils]: 66: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,586 INFO L290 TraceCheckUtils]: 68: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,587 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,587 INFO L290 TraceCheckUtils]: 71: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,588 INFO L290 TraceCheckUtils]: 72: Hoare triple {10264#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,588 INFO L290 TraceCheckUtils]: 73: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,590 INFO L272 TraceCheckUtils]: 74: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,590 INFO L290 TraceCheckUtils]: 75: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} ~cond := #in~cond; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume !(0 == ~cond); {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,591 INFO L290 TraceCheckUtils]: 77: Hoare triple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} assume true; {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} is VALID [2022-04-15 12:33:08,591 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10145#(exists ((v_main_~i~0_135 Int) (v_main_~x~0.base_BEFORE_CALL_22 Int) (v_main_~x~0.offset_BEFORE_CALL_22 Int)) (and (<= v_main_~i~0_135 7) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_22) (+ (* 4 v_main_~i~0_135) v_main_~x~0.offset_BEFORE_CALL_22)) 0)))} {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #68#return; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,592 INFO L290 TraceCheckUtils]: 79: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} havoc #t~mem5; {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,593 INFO L290 TraceCheckUtils]: 80: Hoare triple {10289#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {10314#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} is VALID [2022-04-15 12:33:08,594 INFO L290 TraceCheckUtils]: 81: Hoare triple {10314#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_135 Int)) (and (<= main_~n~0 (+ v_main_~i~0_135 1)) (<= v_main_~i~0_135 7) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_135))) 0))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {10048#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:33:08,594 INFO L272 TraceCheckUtils]: 82: Hoare triple {10048#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:33:08,594 INFO L290 TraceCheckUtils]: 83: Hoare triple {10321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:33:08,594 INFO L290 TraceCheckUtils]: 84: Hoare triple {10325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9998#false} is VALID [2022-04-15 12:33:08,595 INFO L290 TraceCheckUtils]: 85: Hoare triple {9998#false} assume !false; {9998#false} is VALID [2022-04-15 12:33:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 91 proven. 85 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 12:33:08,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:08,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511462543] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:08,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:33:08,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2022-04-15 12:33:08,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:08,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1352152617] [2022-04-15 12:33:08,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1352152617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:08,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:08,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:33:08,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373769058] [2022-04-15 12:33:08,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2022-04-15 12:33:08,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:08,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:08,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:08,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:33:08,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:08,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:33:08,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2028, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:33:08,980 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:11,919 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-04-15 12:33:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:33:11,919 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2022-04-15 12:33:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-15 12:33:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-15 12:33:11,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 82 transitions. [2022-04-15 12:33:11,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:11,992 INFO L225 Difference]: With dead ends: 102 [2022-04-15 12:33:11,993 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 12:33:11,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 72 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=395, Invalid=4435, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:33:11,994 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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-15 12:33:11,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 128 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:33:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 12:33:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-04-15 12:33:12,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:12,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:33:12,038 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:33:12,038 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:33:12,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:12,041 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 12:33:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 12:33:12,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:12,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:12,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-15 12:33:12,042 INFO L87 Difference]: Start difference. First operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-15 12:33:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:12,044 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 12:33:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 12:33:12,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:12,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:12,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:12,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:12,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 76 states have internal predecessors, (77), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:33:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-15 12:33:12,047 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 86 [2022-04-15 12:33:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:12,047 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-15 12:33:12,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 12:33:12,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-15 12:33:12,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 12:33:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 12:33:12,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:12,170 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:12,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:12,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 12:33:12,399 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 29 times [2022-04-15 12:33:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:12,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637904378] [2022-04-15 12:33:12,402 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:33:12,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:33:12,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1169596722, now seen corresponding path program 30 times [2022-04-15 12:33:12,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:12,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109388594] [2022-04-15 12:33:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {11055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10999#true} is VALID [2022-04-15 12:33:12,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-15 12:33:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-15 12:33:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #68#return; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 12:33:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 12:33:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:12,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 12:33:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 12:33:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:12,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 12:33:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 12:33:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:12,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 12:33:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 12:33:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:12,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {11055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:12,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {11055#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10999#true} is VALID [2022-04-15 12:33:12,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-15 12:33:12,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-15 12:33:12,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-15 12:33:12,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11004#(= main_~i~0 0)} is VALID [2022-04-15 12:33:12,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {11004#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11004#(= main_~i~0 0)} is VALID [2022-04-15 12:33:12,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {11004#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:12,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:12,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:12,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:12,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:12,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:12,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:12,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:12,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:12,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:12,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:12,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:12,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:12,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:12,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-15 12:33:12,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-15 12:33:12,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 12:33:12,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 12:33:12,615 INFO L272 TraceCheckUtils]: 26: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:12,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,616 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #68#return; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 12:33:12,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} havoc #t~mem5; {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} is VALID [2022-04-15 12:33:12,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {11014#(and (<= main_~n~0 8) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:12,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:12,617 INFO L272 TraceCheckUtils]: 34: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:12,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,617 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:12,618 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:12,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:12,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:12,619 INFO L272 TraceCheckUtils]: 42: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:12,619 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,619 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:12,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:12,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:12,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:12,620 INFO L272 TraceCheckUtils]: 50: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:12,621 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,621 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:12,622 INFO L290 TraceCheckUtils]: 55: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:12,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:12,623 INFO L290 TraceCheckUtils]: 57: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:12,623 INFO L272 TraceCheckUtils]: 58: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:12,623 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,623 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,624 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:12,624 INFO L290 TraceCheckUtils]: 63: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:12,624 INFO L290 TraceCheckUtils]: 64: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:12,625 INFO L290 TraceCheckUtils]: 65: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:12,625 INFO L272 TraceCheckUtils]: 66: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:12,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,625 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,626 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:12,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:12,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:12,627 INFO L290 TraceCheckUtils]: 73: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:12,627 INFO L272 TraceCheckUtils]: 74: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:12,627 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,627 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,627 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,627 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:12,628 INFO L290 TraceCheckUtils]: 79: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:12,628 INFO L290 TraceCheckUtils]: 80: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:12,628 INFO L290 TraceCheckUtils]: 81: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:12,629 INFO L272 TraceCheckUtils]: 82: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:12,629 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:12,629 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:12,629 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:12,629 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:12,630 INFO L290 TraceCheckUtils]: 87: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:12,630 INFO L290 TraceCheckUtils]: 88: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11054#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:33:12,630 INFO L290 TraceCheckUtils]: 89: Hoare triple {11054#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-15 12:33:12,630 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-15 12:33:12,630 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-15 12:33:12,631 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-15 12:33:12,631 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-15 12:33:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 115 proven. 93 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 12:33:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:12,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109388594] [2022-04-15 12:33:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109388594] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:12,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839785485] [2022-04-15 12:33:12,631 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:33:12,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:12,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:12,633 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:12,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:33:12,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 12:33:12,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:12,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:33:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:13,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-15 12:33:13,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10999#true} is VALID [2022-04-15 12:33:13,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-15 12:33:13,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-15 12:33:13,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-15 12:33:13,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11077#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:13,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {11077#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11077#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:13,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {11077#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:13,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:13,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:13,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:13,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:13,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:13,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:13,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:13,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:13,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:13,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:13,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:13,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:13,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:13,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-15 12:33:13,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-15 12:33:13,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,416 INFO L272 TraceCheckUtils]: 26: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,416 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} #68#return; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {11132#(and (<= 0 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,418 INFO L272 TraceCheckUtils]: 34: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,418 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} #68#return; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {11157#(and (<= 1 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-15 12:33:13,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-15 12:33:13,419 INFO L272 TraceCheckUtils]: 42: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,420 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} #68#return; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-15 12:33:13,420 INFO L290 TraceCheckUtils]: 47: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} havoc #t~mem5; {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} is VALID [2022-04-15 12:33:13,420 INFO L290 TraceCheckUtils]: 48: Hoare triple {11182#(and (<= main_~n~0 8) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-15 12:33:13,421 INFO L290 TraceCheckUtils]: 49: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-15 12:33:13,421 INFO L272 TraceCheckUtils]: 50: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,421 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,421 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,421 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} #68#return; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-15 12:33:13,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} havoc #t~mem5; {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} is VALID [2022-04-15 12:33:13,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {11207#(and (<= main_~n~0 8) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-15 12:33:13,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-15 12:33:13,422 INFO L272 TraceCheckUtils]: 58: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,422 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,430 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} #68#return; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-15 12:33:13,431 INFO L290 TraceCheckUtils]: 63: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} havoc #t~mem5; {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} is VALID [2022-04-15 12:33:13,431 INFO L290 TraceCheckUtils]: 64: Hoare triple {11232#(and (<= main_~n~0 8) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-15 12:33:13,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-15 12:33:13,432 INFO L272 TraceCheckUtils]: 66: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,432 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} #68#return; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-15 12:33:13,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} havoc #t~mem5; {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} is VALID [2022-04-15 12:33:13,433 INFO L290 TraceCheckUtils]: 72: Hoare triple {11257#(and (<= main_~n~0 8) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,433 INFO L290 TraceCheckUtils]: 73: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,433 INFO L272 TraceCheckUtils]: 74: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,433 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,433 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,433 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,434 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} #68#return; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,434 INFO L290 TraceCheckUtils]: 79: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,434 INFO L290 TraceCheckUtils]: 80: Hoare triple {11282#(and (<= 6 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,435 INFO L290 TraceCheckUtils]: 81: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,435 INFO L272 TraceCheckUtils]: 82: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,435 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,435 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,435 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,435 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} #68#return; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,436 INFO L290 TraceCheckUtils]: 87: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} havoc #t~mem5; {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} is VALID [2022-04-15 12:33:13,436 INFO L290 TraceCheckUtils]: 88: Hoare triple {11307#(and (<= 7 main_~i~1) (<= main_~n~0 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11332#(and (<= main_~n~0 8) (<= 8 main_~i~1))} is VALID [2022-04-15 12:33:13,436 INFO L290 TraceCheckUtils]: 89: Hoare triple {11332#(and (<= main_~n~0 8) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-15 12:33:13,436 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-15 12:33:13,436 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-15 12:33:13,436 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-15 12:33:13,437 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-15 12:33:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 12:33:13,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:13,771 INFO L290 TraceCheckUtils]: 93: Hoare triple {11000#false} assume !false; {11000#false} is VALID [2022-04-15 12:33:13,771 INFO L290 TraceCheckUtils]: 92: Hoare triple {11000#false} assume 0 == ~cond; {11000#false} is VALID [2022-04-15 12:33:13,771 INFO L290 TraceCheckUtils]: 91: Hoare triple {11000#false} ~cond := #in~cond; {11000#false} is VALID [2022-04-15 12:33:13,771 INFO L272 TraceCheckUtils]: 90: Hoare triple {11000#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {11000#false} is VALID [2022-04-15 12:33:13,773 INFO L290 TraceCheckUtils]: 89: Hoare triple {11054#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11000#false} is VALID [2022-04-15 12:33:13,774 INFO L290 TraceCheckUtils]: 88: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11054#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:33:13,774 INFO L290 TraceCheckUtils]: 87: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:13,774 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10999#true} {11049#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:13,774 INFO L290 TraceCheckUtils]: 85: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,775 INFO L290 TraceCheckUtils]: 83: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,775 INFO L272 TraceCheckUtils]: 82: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,775 INFO L290 TraceCheckUtils]: 81: Hoare triple {11049#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:13,775 INFO L290 TraceCheckUtils]: 80: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11049#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:33:13,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:13,776 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {10999#true} {11044#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:13,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,776 INFO L272 TraceCheckUtils]: 74: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,777 INFO L290 TraceCheckUtils]: 73: Hoare triple {11044#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:13,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11044#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:33:13,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:13,778 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {10999#true} {11039#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:13,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,778 INFO L290 TraceCheckUtils]: 67: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,778 INFO L272 TraceCheckUtils]: 66: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {11039#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:13,779 INFO L290 TraceCheckUtils]: 64: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11039#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:33:13,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:13,779 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10999#true} {11034#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:13,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,779 INFO L290 TraceCheckUtils]: 60: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,779 INFO L290 TraceCheckUtils]: 59: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,780 INFO L272 TraceCheckUtils]: 58: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,780 INFO L290 TraceCheckUtils]: 57: Hoare triple {11034#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:13,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11034#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:33:13,780 INFO L290 TraceCheckUtils]: 55: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:13,781 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10999#true} {11029#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:13,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,781 INFO L272 TraceCheckUtils]: 50: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {11029#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:13,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11029#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:33:13,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:13,782 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10999#true} {11024#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:13,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,783 INFO L272 TraceCheckUtils]: 42: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {11024#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:13,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11024#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:33:13,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:13,784 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10999#true} {11019#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:13,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,785 INFO L272 TraceCheckUtils]: 34: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {11019#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:13,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {11019#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:33:13,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:33:13,786 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10999#true} {11531#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:33:13,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {10999#true} assume !(0 == ~cond); {10999#true} is VALID [2022-04-15 12:33:13,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#true} ~cond := #in~cond; {10999#true} is VALID [2022-04-15 12:33:13,786 INFO L272 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {10999#true} is VALID [2022-04-15 12:33:13,786 INFO L290 TraceCheckUtils]: 25: Hoare triple {11531#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:33:13,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {11013#(<= main_~n~0 8)} ~i~1 := 0; {11531#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:33:13,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {11012#(<= main_~i~0 8)} assume !(~i~0 < ~n~0); {11013#(<= main_~n~0 8)} is VALID [2022-04-15 12:33:13,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {11011#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11012#(<= main_~i~0 8)} is VALID [2022-04-15 12:33:13,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {11011#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11011#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:13,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {11010#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11011#(<= main_~i~0 7)} is VALID [2022-04-15 12:33:13,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {11010#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11010#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:13,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11010#(<= main_~i~0 6)} is VALID [2022-04-15 12:33:13,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11009#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:13,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {11008#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11009#(<= main_~i~0 5)} is VALID [2022-04-15 12:33:13,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {11008#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11008#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:13,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {11007#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11008#(<= main_~i~0 4)} is VALID [2022-04-15 12:33:13,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {11007#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11007#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:13,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {11006#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11007#(<= main_~i~0 3)} is VALID [2022-04-15 12:33:13,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {11006#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11006#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:13,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11006#(<= main_~i~0 2)} is VALID [2022-04-15 12:33:13,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {11005#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11005#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:13,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {11077#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11005#(<= main_~i~0 1)} is VALID [2022-04-15 12:33:13,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {11077#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {11077#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:13,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {10999#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {11077#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:13,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {10999#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {10999#true} is VALID [2022-04-15 12:33:13,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {10999#true} call #t~ret6 := main(); {10999#true} is VALID [2022-04-15 12:33:13,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10999#true} {10999#true} #70#return; {10999#true} is VALID [2022-04-15 12:33:13,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {10999#true} assume true; {10999#true} is VALID [2022-04-15 12:33:13,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {10999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10999#true} is VALID [2022-04-15 12:33:13,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {10999#true} call ULTIMATE.init(); {10999#true} is VALID [2022-04-15 12:33:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 144 proven. 64 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 12:33:13,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839785485] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:13,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:33:13,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 33 [2022-04-15 12:33:13,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:13,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637904378] [2022-04-15 12:33:13,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637904378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:13,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:13,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:33:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992646084] [2022-04-15 12:33:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:13,798 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 94 [2022-04-15 12:33:13,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:13,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:13,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:13,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:33:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:33:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=819, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:33:13,849 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:14,697 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2022-04-15 12:33:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:33:14,697 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 94 [2022-04-15 12:33:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-15 12:33:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2022-04-15 12:33:14,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2022-04-15 12:33:14,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:14,773 INFO L225 Difference]: With dead ends: 144 [2022-04-15 12:33:14,773 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 12:33:14,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=490, Invalid=2162, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:33:14,775 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 48 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:14,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 61 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:33:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 12:33:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2022-04-15 12:33:14,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:14,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:33:14,817 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:33:14,817 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:33:14,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:14,819 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 12:33:14,819 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 12:33:14,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:14,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:14,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-15 12:33:14,819 INFO L87 Difference]: Start difference. First operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 100 states. [2022-04-15 12:33:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:14,821 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 12:33:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-04-15 12:33:14,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:14,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:14,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:14,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.025974025974026) internal successors, (79), 78 states have internal predecessors, (79), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:33:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-15 12:33:14,823 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-04-15 12:33:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:14,823 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-15 12:33:14,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.409090909090909) internal successors, (53), 21 states have internal predecessors, (53), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:33:14,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-15 12:33:14,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:14,985 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 12:33:14,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 12:33:14,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:14,986 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:15,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 12:33:15,204 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 12:33:15,204 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:15,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 31 times [2022-04-15 12:33:15,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:15,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1139369971] [2022-04-15 12:33:15,207 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:33:15,207 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:33:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1315000236, now seen corresponding path program 32 times [2022-04-15 12:33:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:15,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613462123] [2022-04-15 12:33:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12354#true} is VALID [2022-04-15 12:33:15,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-15 12:33:15,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 12:33:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 12:33:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:33:15,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 12:33:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:15,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 12:33:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 12:33:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 12:33:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:15,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 12:33:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:15,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-15 12:33:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:15,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:15,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {12414#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12354#true} is VALID [2022-04-15 12:33:15,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-15 12:33:15,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-15 12:33:15,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-15 12:33:15,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-15 12:33:15,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-15 12:33:15,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:33:15,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:33:15,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:33:15,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:33:15,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:33:15,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:33:15,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:33:15,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:33:15,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:33:15,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:33:15,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:33:15,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:33:15,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:33:15,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:33:15,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:33:15,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12368#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:33:15,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {12368#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 12:33:15,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 12:33:15,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:15,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:15,652 INFO L272 TraceCheckUtils]: 28: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:33:15,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,653 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12354#true} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:15,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} havoc #t~mem5; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:33:15,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:33:15,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:33:15,654 INFO L272 TraceCheckUtils]: 36: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:33:15,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,655 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:33:15,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:33:15,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:15,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:15,656 INFO L272 TraceCheckUtils]: 44: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:33:15,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,657 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:15,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:33:15,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:15,658 INFO L290 TraceCheckUtils]: 51: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:15,658 INFO L272 TraceCheckUtils]: 52: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:33:15,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,659 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:15,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:33:15,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:15,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:15,660 INFO L272 TraceCheckUtils]: 60: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:33:15,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,660 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,661 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:15,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:15,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:15,662 INFO L290 TraceCheckUtils]: 67: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:15,662 INFO L272 TraceCheckUtils]: 68: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:33:15,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,662 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,663 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:15,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:33:15,664 INFO L290 TraceCheckUtils]: 74: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:15,664 INFO L290 TraceCheckUtils]: 75: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:15,664 INFO L272 TraceCheckUtils]: 76: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:33:15,664 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,664 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,664 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,665 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:15,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:33:15,666 INFO L290 TraceCheckUtils]: 82: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:15,666 INFO L290 TraceCheckUtils]: 83: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:15,666 INFO L272 TraceCheckUtils]: 84: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:33:15,666 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:33:15,666 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:33:15,666 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:33:15,667 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:15,667 INFO L290 TraceCheckUtils]: 89: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:33:15,668 INFO L290 TraceCheckUtils]: 90: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:33:15,668 INFO L290 TraceCheckUtils]: 91: Hoare triple {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:33:15,668 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12412#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:33:15,669 INFO L290 TraceCheckUtils]: 93: Hoare triple {12412#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12413#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:33:15,669 INFO L290 TraceCheckUtils]: 94: Hoare triple {12413#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12355#false} is VALID [2022-04-15 12:33:15,669 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-15 12:33:15,669 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 12:33:15,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:15,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613462123] [2022-04-15 12:33:15,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613462123] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:15,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620837899] [2022-04-15 12:33:15,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:33:15,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:15,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:15,671 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:15,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:33:15,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:33:15,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:15,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 12:33:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:15,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:15,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:34:54,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 12:34:54,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-15 12:34:54,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12354#true} is VALID [2022-04-15 12:34:54,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:54,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-15 12:34:54,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-15 12:34:54,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-15 12:34:54,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-15 12:34:54,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-15 12:34:54,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:34:54,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:34:54,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:34:54,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:34:54,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:34:54,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:34:54,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:34:54,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:34:54,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:34:54,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:34:54,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:34:54,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:34:54,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:34:54,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:34:54,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:34:54,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 12:34:54,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 12:34:54,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 12:34:54,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:34:54,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:34:54,703 INFO L272 TraceCheckUtils]: 28: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,704 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #68#return; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:34:54,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} havoc #t~mem5; {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:34:54,705 INFO L290 TraceCheckUtils]: 34: Hoare triple {12370#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:34:54,705 INFO L290 TraceCheckUtils]: 35: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:34:54,706 INFO L272 TraceCheckUtils]: 36: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,708 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} #68#return; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:34:54,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} havoc #t~mem5; {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:34:54,709 INFO L290 TraceCheckUtils]: 42: Hoare triple {12521#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0) (= 0 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,710 INFO L272 TraceCheckUtils]: 44: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,711 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {12546#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,713 INFO L272 TraceCheckUtils]: 52: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,714 INFO L290 TraceCheckUtils]: 53: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,715 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,716 INFO L290 TraceCheckUtils]: 58: Hoare triple {12571#(and (= main_~i~1 3) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,716 INFO L290 TraceCheckUtils]: 59: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,717 INFO L272 TraceCheckUtils]: 60: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,717 INFO L290 TraceCheckUtils]: 61: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,718 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,718 INFO L290 TraceCheckUtils]: 65: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {12596#(and (= main_~i~1 4) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,720 INFO L272 TraceCheckUtils]: 68: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,721 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,722 INFO L290 TraceCheckUtils]: 74: Hoare triple {12621#(and (= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,722 INFO L290 TraceCheckUtils]: 75: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,723 INFO L272 TraceCheckUtils]: 76: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,723 INFO L290 TraceCheckUtils]: 77: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,723 INFO L290 TraceCheckUtils]: 78: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,723 INFO L290 TraceCheckUtils]: 79: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,724 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,725 INFO L290 TraceCheckUtils]: 82: Hoare triple {12646#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,725 INFO L290 TraceCheckUtils]: 83: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,726 INFO L272 TraceCheckUtils]: 84: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,726 INFO L290 TraceCheckUtils]: 85: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} ~cond := #in~cond; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume !(0 == ~cond); {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,726 INFO L290 TraceCheckUtils]: 87: Hoare triple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} assume true; {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} is VALID [2022-04-15 12:34:54,727 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12502#(exists ((v_main_~x~0.offset_BEFORE_CALL_29 Int) (v_main_~x~0.base_BEFORE_CALL_29 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_29) (+ 32 v_main_~x~0.offset_BEFORE_CALL_29)) 0))} {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #68#return; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} havoc #t~mem5; {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,727 INFO L290 TraceCheckUtils]: 90: Hoare triple {12671#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12696#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} is VALID [2022-04-15 12:34:54,728 INFO L290 TraceCheckUtils]: 91: Hoare triple {12696#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:34:54,728 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:34:54,728 INFO L290 TraceCheckUtils]: 93: Hoare triple {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:34:54,729 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-15 12:34:54,729 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-15 12:34:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 12:34:54,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:34:56,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-04-15 12:34:56,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-15 12:34:57,158 INFO L290 TraceCheckUtils]: 95: Hoare triple {12355#false} assume !false; {12355#false} is VALID [2022-04-15 12:34:57,158 INFO L290 TraceCheckUtils]: 94: Hoare triple {12707#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12355#false} is VALID [2022-04-15 12:34:57,159 INFO L290 TraceCheckUtils]: 93: Hoare triple {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12707#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:34:57,159 INFO L272 TraceCheckUtils]: 92: Hoare triple {12411#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12703#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:34:57,160 INFO L290 TraceCheckUtils]: 91: Hoare triple {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12411#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:34:57,160 INFO L290 TraceCheckUtils]: 90: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12410#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,161 INFO L290 TraceCheckUtils]: 89: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:34:57,162 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {12354#true} {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:34:57,162 INFO L290 TraceCheckUtils]: 87: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,162 INFO L290 TraceCheckUtils]: 86: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:34:57,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:34:57,162 INFO L272 TraceCheckUtils]: 84: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:34:57,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:34:57,163 INFO L290 TraceCheckUtils]: 82: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12405#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:34:57,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:34:57,164 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {12354#true} {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:34:57,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:34:57,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:34:57,164 INFO L272 TraceCheckUtils]: 76: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:34:57,165 INFO L290 TraceCheckUtils]: 75: Hoare triple {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:34:57,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12400#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:34:57,166 INFO L290 TraceCheckUtils]: 73: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:34:57,166 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12354#true} {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:34:57,166 INFO L290 TraceCheckUtils]: 71: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,166 INFO L290 TraceCheckUtils]: 70: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:34:57,166 INFO L290 TraceCheckUtils]: 69: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:34:57,166 INFO L272 TraceCheckUtils]: 68: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:34:57,167 INFO L290 TraceCheckUtils]: 67: Hoare triple {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:34:57,167 INFO L290 TraceCheckUtils]: 66: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12395#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:34:57,168 INFO L290 TraceCheckUtils]: 65: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,168 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12354#true} {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,169 INFO L290 TraceCheckUtils]: 63: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,169 INFO L290 TraceCheckUtils]: 62: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:34:57,169 INFO L290 TraceCheckUtils]: 61: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:34:57,169 INFO L272 TraceCheckUtils]: 60: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:34:57,169 INFO L290 TraceCheckUtils]: 59: Hoare triple {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,170 INFO L290 TraceCheckUtils]: 58: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12390#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:34:57,171 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {12354#true} {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:34:57,171 INFO L290 TraceCheckUtils]: 55: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,171 INFO L290 TraceCheckUtils]: 54: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:34:57,171 INFO L290 TraceCheckUtils]: 53: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:34:57,171 INFO L272 TraceCheckUtils]: 52: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:34:57,171 INFO L290 TraceCheckUtils]: 51: Hoare triple {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:34:57,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12385#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:34:57,172 INFO L290 TraceCheckUtils]: 49: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:34:57,173 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12354#true} {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:34:57,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,173 INFO L290 TraceCheckUtils]: 46: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:34:57,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:34:57,173 INFO L272 TraceCheckUtils]: 44: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:34:57,174 INFO L290 TraceCheckUtils]: 43: Hoare triple {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:34:57,174 INFO L290 TraceCheckUtils]: 42: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12380#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:34:57,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:34:57,175 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12354#true} {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:34:57,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:34:57,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:34:57,175 INFO L272 TraceCheckUtils]: 36: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:34:57,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:34:57,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {12375#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:34:57,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,177 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12354#true} {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {12354#true} assume !(0 == ~cond); {12354#true} is VALID [2022-04-15 12:34:57,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {12354#true} ~cond := #in~cond; {12354#true} is VALID [2022-04-15 12:34:57,178 INFO L272 TraceCheckUtils]: 28: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {12354#true} is VALID [2022-04-15 12:34:57,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} ~i~1 := 0; {12897#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:34:57,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} assume !(~i~0 < ~n~0); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 12:34:57,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 12:34:57,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12369#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32)) 0)} is VALID [2022-04-15 12:34:57,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12367#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:34:57,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:34:57,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12366#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:34:57,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:34:57,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12365#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:34:57,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:34:57,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12364#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:34:57,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:34:57,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12363#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:34:57,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:34:57,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12362#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:34:57,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:34:57,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12361#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:34:57,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:34:57,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {12359#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12360#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:34:57,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {12359#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {12359#(= main_~i~0 0)} is VALID [2022-04-15 12:34:57,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {12354#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {12359#(= main_~i~0 0)} is VALID [2022-04-15 12:34:57,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {12354#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {12354#true} is VALID [2022-04-15 12:34:57,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {12354#true} call #t~ret6 := main(); {12354#true} is VALID [2022-04-15 12:34:57,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12354#true} {12354#true} #70#return; {12354#true} is VALID [2022-04-15 12:34:57,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {12354#true} assume true; {12354#true} is VALID [2022-04-15 12:34:57,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {12354#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {12354#true} is VALID [2022-04-15 12:34:57,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {12354#true} call ULTIMATE.init(); {12354#true} is VALID [2022-04-15 12:34:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 16 proven. 209 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 12:34:57,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620837899] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:34:57,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:34:57,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 38 [2022-04-15 12:34:57,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:34:57,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1139369971] [2022-04-15 12:34:57,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1139369971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:34:57,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:34:57,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:34:57,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800287710] [2022-04-15 12:34:57,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:34:57,188 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 96 [2022-04-15 12:34:57,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:34:57,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:34:57,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:34:57,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:34:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:57,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:34:57,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1291, Unknown=9, NotChecked=0, Total=1406 [2022-04-15 12:34:57,245 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:35:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:00,097 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-04-15 12:35:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:35:00,098 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 96 [2022-04-15 12:35:00,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:35:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-15 12:35:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:35:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 89 transitions. [2022-04-15 12:35:00,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 89 transitions. [2022-04-15 12:35:00,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:00,177 INFO L225 Difference]: With dead ends: 112 [2022-04-15 12:35:00,177 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 12:35:00,178 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 178 SyntacticMatches, 20 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 100.5s TimeCoverageRelationStatistics Valid=244, Invalid=3529, Unknown=9, NotChecked=0, Total=3782 [2022-04-15 12:35:00,178 INFO L913 BasicCegarLoop]: 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-15 12:35:00,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 131 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:35:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 12:35:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2022-04-15 12:35:00,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:00,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:00,227 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:00,227 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:00,229 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 12:35:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 12:35:00,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:00,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:00,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-15 12:35:00,229 INFO L87 Difference]: Start difference. First operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-15 12:35:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:00,230 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 12:35:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 12:35:00,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:00,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:00,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:00,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:00,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 84 states have internal predecessors, (85), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-15 12:35:00,232 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 96 [2022-04-15 12:35:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:00,233 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-15 12:35:00,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 10 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 12:35:00,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-15 12:35:00,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-15 12:35:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 12:35:00,406 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:00,406 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:00,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 12:35:00,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:35:00,607 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 33 times [2022-04-15 12:35:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:00,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [854608038] [2022-04-15 12:35:00,609 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:35:00,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:35:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1911993978, now seen corresponding path program 34 times [2022-04-15 12:35:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:00,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154787222] [2022-04-15 12:35:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:35:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13708#true} is VALID [2022-04-15 12:35:00,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-15 12:35:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-15 12:35:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #68#return; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 12:35:00,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 12:35:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 12:35:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:00,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 12:35:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:00,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 12:35:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:00,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 12:35:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:00,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 12:35:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-15 12:35:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:00,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-15 12:35:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:00,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:00,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:35:00,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13708#true} is VALID [2022-04-15 12:35:00,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-15 12:35:00,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-15 12:35:00,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-15 12:35:00,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13713#(= main_~i~0 0)} is VALID [2022-04-15 12:35:00,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {13713#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13713#(= main_~i~0 0)} is VALID [2022-04-15 12:35:00,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {13713#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:00,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:00,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:00,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:00,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:00,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:00,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:00,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:00,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:00,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:00,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:00,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:00,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:00,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:00,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:00,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:00,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:00,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-15 12:35:00,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 12:35:00,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 12:35:00,873 INFO L272 TraceCheckUtils]: 28: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,873 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #68#return; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 12:35:00,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} havoc #t~mem5; {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} is VALID [2022-04-15 12:35:00,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {13724#(and (<= main_~n~0 9) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:00,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:00,874 INFO L272 TraceCheckUtils]: 36: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,874 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,875 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:00,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:00,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:00,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:00,876 INFO L272 TraceCheckUtils]: 44: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,877 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:00,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:00,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:00,878 INFO L290 TraceCheckUtils]: 51: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:00,878 INFO L272 TraceCheckUtils]: 52: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,878 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,878 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,878 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:00,879 INFO L290 TraceCheckUtils]: 57: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:00,879 INFO L290 TraceCheckUtils]: 58: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:00,879 INFO L290 TraceCheckUtils]: 59: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:00,879 INFO L272 TraceCheckUtils]: 60: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,880 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,880 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,880 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:00,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:00,881 INFO L290 TraceCheckUtils]: 66: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:00,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:00,881 INFO L272 TraceCheckUtils]: 68: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,881 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,881 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,881 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,882 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:00,882 INFO L290 TraceCheckUtils]: 73: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:00,882 INFO L290 TraceCheckUtils]: 74: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:00,883 INFO L290 TraceCheckUtils]: 75: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:00,883 INFO L272 TraceCheckUtils]: 76: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,883 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,883 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,883 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,883 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:00,884 INFO L290 TraceCheckUtils]: 81: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:00,884 INFO L290 TraceCheckUtils]: 82: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:00,884 INFO L290 TraceCheckUtils]: 83: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:00,884 INFO L272 TraceCheckUtils]: 84: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,884 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,884 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,885 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,885 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:00,885 INFO L290 TraceCheckUtils]: 89: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:00,886 INFO L290 TraceCheckUtils]: 90: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:00,886 INFO L290 TraceCheckUtils]: 91: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:00,886 INFO L272 TraceCheckUtils]: 92: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:00,886 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:00,886 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:00,886 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:00,887 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:00,887 INFO L290 TraceCheckUtils]: 97: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:00,887 INFO L290 TraceCheckUtils]: 98: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13769#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:35:00,887 INFO L290 TraceCheckUtils]: 99: Hoare triple {13769#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-15 12:35:00,888 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-15 12:35:00,888 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-15 12:35:00,888 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-15 12:35:00,888 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-15 12:35:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 147 proven. 114 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 12:35:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:00,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154787222] [2022-04-15 12:35:00,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154787222] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:00,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511488283] [2022-04-15 12:35:00,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:35:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:00,890 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:35:00,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:35:01,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:35:01,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:01,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:35:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:01,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:01,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-15 12:35:01,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13708#true} is VALID [2022-04-15 12:35:01,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-15 12:35:01,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-15 12:35:01,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-15 12:35:01,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13792#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:01,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {13792#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:01,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {13792#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:01,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:01,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:01,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:01,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:01,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:01,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:01,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:01,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:01,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:01,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:01,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:01,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:01,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:01,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:01,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:01,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:01,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-15 12:35:01,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-15 12:35:01,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-15 12:35:01,817 INFO L272 TraceCheckUtils]: 28: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,818 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} #68#return; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-15 12:35:01,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} havoc #t~mem5; {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} is VALID [2022-04-15 12:35:01,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {13853#(and (<= main_~n~0 9) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 12:35:01,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 12:35:01,819 INFO L272 TraceCheckUtils]: 36: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,819 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,820 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} #68#return; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 12:35:01,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} havoc #t~mem5; {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 12:35:01,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {13878#(and (<= 1 main_~i~1) (<= main_~n~0 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:01,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:01,821 INFO L272 TraceCheckUtils]: 44: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,822 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} #68#return; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:01,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} havoc #t~mem5; {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:01,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {13903#(and (<= main_~n~0 9) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:01,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:01,823 INFO L272 TraceCheckUtils]: 52: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,824 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} #68#return; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:01,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} havoc #t~mem5; {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:01,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {13928#(and (<= main_~n~0 9) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:01,825 INFO L290 TraceCheckUtils]: 59: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:01,825 INFO L272 TraceCheckUtils]: 60: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,825 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} #68#return; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:01,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} havoc #t~mem5; {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:01,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {13953#(and (<= main_~n~0 9) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-15 12:35:01,827 INFO L290 TraceCheckUtils]: 67: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-15 12:35:01,827 INFO L272 TraceCheckUtils]: 68: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,827 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,827 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} #68#return; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-15 12:35:01,828 INFO L290 TraceCheckUtils]: 73: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} havoc #t~mem5; {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} is VALID [2022-04-15 12:35:01,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {13978#(and (<= main_~n~0 9) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 12:35:01,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 12:35:01,829 INFO L272 TraceCheckUtils]: 76: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,829 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,829 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,829 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,829 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} #68#return; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 12:35:01,830 INFO L290 TraceCheckUtils]: 81: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} havoc #t~mem5; {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} is VALID [2022-04-15 12:35:01,830 INFO L290 TraceCheckUtils]: 82: Hoare triple {14003#(and (<= 6 main_~i~1) (<= main_~n~0 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-15 12:35:01,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-15 12:35:01,830 INFO L272 TraceCheckUtils]: 84: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,830 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,831 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} #68#return; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-15 12:35:01,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} havoc #t~mem5; {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} is VALID [2022-04-15 12:35:01,832 INFO L290 TraceCheckUtils]: 90: Hoare triple {14028#(and (<= main_~n~0 9) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-15 12:35:01,832 INFO L290 TraceCheckUtils]: 91: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-15 12:35:01,832 INFO L272 TraceCheckUtils]: 92: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:01,832 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:01,832 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:01,833 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:01,833 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} #68#return; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-15 12:35:01,833 INFO L290 TraceCheckUtils]: 97: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} havoc #t~mem5; {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} is VALID [2022-04-15 12:35:01,834 INFO L290 TraceCheckUtils]: 98: Hoare triple {14053#(and (<= main_~n~0 9) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {14078#(and (<= main_~n~0 9) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:01,834 INFO L290 TraceCheckUtils]: 99: Hoare triple {14078#(and (<= main_~n~0 9) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-15 12:35:01,834 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-15 12:35:01,834 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-15 12:35:01,834 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-15 12:35:01,834 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-15 12:35:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 180 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 12:35:01,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:02,209 INFO L290 TraceCheckUtils]: 103: Hoare triple {13709#false} assume !false; {13709#false} is VALID [2022-04-15 12:35:02,210 INFO L290 TraceCheckUtils]: 102: Hoare triple {13709#false} assume 0 == ~cond; {13709#false} is VALID [2022-04-15 12:35:02,210 INFO L290 TraceCheckUtils]: 101: Hoare triple {13709#false} ~cond := #in~cond; {13709#false} is VALID [2022-04-15 12:35:02,210 INFO L272 TraceCheckUtils]: 100: Hoare triple {13709#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13709#false} is VALID [2022-04-15 12:35:02,210 INFO L290 TraceCheckUtils]: 99: Hoare triple {13769#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13709#false} is VALID [2022-04-15 12:35:02,210 INFO L290 TraceCheckUtils]: 98: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13769#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:35:02,211 INFO L290 TraceCheckUtils]: 97: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:02,211 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {13708#true} {13764#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:02,211 INFO L290 TraceCheckUtils]: 95: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,211 INFO L290 TraceCheckUtils]: 94: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,211 INFO L290 TraceCheckUtils]: 93: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,211 INFO L272 TraceCheckUtils]: 92: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,212 INFO L290 TraceCheckUtils]: 91: Hoare triple {13764#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:02,212 INFO L290 TraceCheckUtils]: 90: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13764#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:02,212 INFO L290 TraceCheckUtils]: 89: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:02,212 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {13708#true} {13759#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:02,212 INFO L290 TraceCheckUtils]: 87: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,212 INFO L290 TraceCheckUtils]: 86: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,213 INFO L272 TraceCheckUtils]: 84: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {13759#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:02,213 INFO L290 TraceCheckUtils]: 82: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13759#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:02,213 INFO L290 TraceCheckUtils]: 81: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:02,214 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {13708#true} {13754#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:02,214 INFO L290 TraceCheckUtils]: 79: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,214 INFO L290 TraceCheckUtils]: 78: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,214 INFO L290 TraceCheckUtils]: 77: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,214 INFO L272 TraceCheckUtils]: 76: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,214 INFO L290 TraceCheckUtils]: 75: Hoare triple {13754#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:02,215 INFO L290 TraceCheckUtils]: 74: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13754#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:02,215 INFO L290 TraceCheckUtils]: 73: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:02,215 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13708#true} {13749#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:02,215 INFO L290 TraceCheckUtils]: 71: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,215 INFO L290 TraceCheckUtils]: 70: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,215 INFO L290 TraceCheckUtils]: 69: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,215 INFO L272 TraceCheckUtils]: 68: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {13749#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:02,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13749#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:02,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:02,216 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {13708#true} {13744#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:02,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,217 INFO L272 TraceCheckUtils]: 60: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {13744#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:02,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13744#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:02,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:02,223 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {13708#true} {13739#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:02,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,224 INFO L272 TraceCheckUtils]: 52: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {13739#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:02,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13739#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:02,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:02,225 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13708#true} {13734#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:02,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,226 INFO L272 TraceCheckUtils]: 44: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {13734#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:02,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13734#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:02,226 INFO L290 TraceCheckUtils]: 41: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:02,227 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13708#true} {13729#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:02,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,227 INFO L272 TraceCheckUtils]: 36: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {13729#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:02,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {13729#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:02,228 INFO L290 TraceCheckUtils]: 33: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:02,228 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13708#true} {14301#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:02,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {13708#true} assume !(0 == ~cond); {13708#true} is VALID [2022-04-15 12:35:02,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {13708#true} ~cond := #in~cond; {13708#true} is VALID [2022-04-15 12:35:02,228 INFO L272 TraceCheckUtils]: 28: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {13708#true} is VALID [2022-04-15 12:35:02,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {14301#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:02,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {13723#(<= main_~n~0 9)} ~i~1 := 0; {14301#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:02,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {13722#(<= main_~i~0 9)} assume !(~i~0 < ~n~0); {13723#(<= main_~n~0 9)} is VALID [2022-04-15 12:35:02,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {13721#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13722#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:02,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {13721#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13721#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:02,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {13720#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13721#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:02,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {13720#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13720#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:02,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {13719#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13720#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:02,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {13719#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13719#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:02,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {13718#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13719#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:02,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {13718#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13718#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:02,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {13717#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13718#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:02,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {13717#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13717#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:02,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {13716#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13717#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:02,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {13716#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13716#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:02,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {13715#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13716#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:02,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {13715#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13715#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:02,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {13714#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13715#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:02,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {13714#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13714#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:02,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {13792#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13714#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:02,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {13792#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {13792#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:02,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {13708#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {13792#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:02,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {13708#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {13708#true} is VALID [2022-04-15 12:35:02,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {13708#true} call #t~ret6 := main(); {13708#true} is VALID [2022-04-15 12:35:02,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13708#true} {13708#true} #70#return; {13708#true} is VALID [2022-04-15 12:35:02,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {13708#true} assume true; {13708#true} is VALID [2022-04-15 12:35:02,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13708#true} is VALID [2022-04-15 12:35:02,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {13708#true} call ULTIMATE.init(); {13708#true} is VALID [2022-04-15 12:35:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 180 proven. 81 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 12:35:02,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511488283] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:35:02,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:35:02,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 36 [2022-04-15 12:35:02,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:02,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [854608038] [2022-04-15 12:35:02,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [854608038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:02,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:02,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:35:02,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104742481] [2022-04-15 12:35:02,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 104 [2022-04-15 12:35:02,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:02,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:02,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:02,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:35:02,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:02,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:35:02,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:35:02,284 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:03,160 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-04-15 12:35:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:35:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 104 [2022-04-15 12:35:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-15 12:35:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 99 transitions. [2022-04-15 12:35:03,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 99 transitions. [2022-04-15 12:35:03,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:03,236 INFO L225 Difference]: With dead ends: 158 [2022-04-15 12:35:03,236 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 12:35:03,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=582, Invalid=2610, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:35:03,238 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:03,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 78 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:35:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 12:35:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-15 12:35:03,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:03,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:03,287 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:03,287 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:03,289 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 12:35:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 12:35:03,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:03,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:03,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-15 12:35:03,289 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 110 states. [2022-04-15 12:35:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:03,291 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-04-15 12:35:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-04-15 12:35:03,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:03,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:03,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:03,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 86 states have internal predecessors, (87), 12 states have call successors, (12), 12 states have call predecessors, (12), 11 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-04-15 12:35:03,293 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-04-15 12:35:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:03,293 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-04-15 12:35:03,293 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:03,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 110 transitions. [2022-04-15 12:35:03,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 12:35:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 12:35:03,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:03,450 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:03,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:35:03,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:03,663 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 35 times [2022-04-15 12:35:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:03,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230336076] [2022-04-15 12:35:03,666 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:35:03,666 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:35:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1220002588, now seen corresponding path program 36 times [2022-04-15 12:35:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:03,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923038469] [2022-04-15 12:35:03,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:35:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {15268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15202#true} is VALID [2022-04-15 12:35:04,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-15 12:35:04,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 12:35:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #68#return; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 12:35:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 12:35:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 12:35:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:04,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 12:35:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 12:35:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-15 12:35:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:04,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-15 12:35:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 12:35:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:04,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {15202#true} call ULTIMATE.init(); {15268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:35:04,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {15268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15202#true} is VALID [2022-04-15 12:35:04,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-15 12:35:04,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-15 12:35:04,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {15202#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15202#true} is VALID [2022-04-15 12:35:04,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {15202#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {15207#(= main_~i~0 0)} is VALID [2022-04-15 12:35:04,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {15207#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15207#(= main_~i~0 0)} is VALID [2022-04-15 12:35:04,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {15207#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:35:04,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:35:04,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {15208#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:35:04,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:35:04,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {15209#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:35:04,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:35:04,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {15210#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:35:04,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:35:04,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {15211#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:35:04,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:35:04,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:35:04,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:35:04,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {15213#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:35:04,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:35:04,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {15214#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:35:04,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:35:04,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {15215#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15216#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:35:04,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {15216#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15217#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:35:04,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {15217#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} is VALID [2022-04-15 12:35:04,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} assume !(~i~0 < ~n~0); {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} is VALID [2022-04-15 12:35:04,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {15218#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0)} ~i~1 := 0; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:04,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:04,130 INFO L272 TraceCheckUtils]: 30: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,131 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15202#true} {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #68#return; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:04,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} havoc #t~mem5; {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:04,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {15219#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 36)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,132 INFO L290 TraceCheckUtils]: 37: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,132 INFO L272 TraceCheckUtils]: 38: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,133 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15202#true} {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,134 INFO L290 TraceCheckUtils]: 44: Hoare triple {15224#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:04,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:04,134 INFO L272 TraceCheckUtils]: 46: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,135 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15202#true} {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:04,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:04,136 INFO L290 TraceCheckUtils]: 52: Hoare triple {15229#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:04,136 INFO L290 TraceCheckUtils]: 53: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:04,136 INFO L272 TraceCheckUtils]: 54: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,137 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15202#true} {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:04,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:04,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {15234#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:04,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:04,138 INFO L272 TraceCheckUtils]: 62: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,139 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15202#true} {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:04,139 INFO L290 TraceCheckUtils]: 67: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:04,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {15239#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,140 INFO L272 TraceCheckUtils]: 70: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,140 INFO L290 TraceCheckUtils]: 71: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,140 INFO L290 TraceCheckUtils]: 72: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,141 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15202#true} {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,141 INFO L290 TraceCheckUtils]: 75: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {15244#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:04,142 INFO L290 TraceCheckUtils]: 77: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:04,142 INFO L272 TraceCheckUtils]: 78: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,143 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15202#true} {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:04,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:04,144 INFO L290 TraceCheckUtils]: 84: Hoare triple {15249#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:04,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:04,144 INFO L272 TraceCheckUtils]: 86: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,144 INFO L290 TraceCheckUtils]: 88: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,144 INFO L290 TraceCheckUtils]: 89: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,145 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15202#true} {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:04,145 INFO L290 TraceCheckUtils]: 91: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:04,146 INFO L290 TraceCheckUtils]: 92: Hoare triple {15254#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:04,146 INFO L290 TraceCheckUtils]: 93: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:04,146 INFO L272 TraceCheckUtils]: 94: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15202#true} is VALID [2022-04-15 12:35:04,146 INFO L290 TraceCheckUtils]: 95: Hoare triple {15202#true} ~cond := #in~cond; {15202#true} is VALID [2022-04-15 12:35:04,146 INFO L290 TraceCheckUtils]: 96: Hoare triple {15202#true} assume !(0 == ~cond); {15202#true} is VALID [2022-04-15 12:35:04,147 INFO L290 TraceCheckUtils]: 97: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:04,147 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15202#true} {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:04,147 INFO L290 TraceCheckUtils]: 99: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:04,148 INFO L290 TraceCheckUtils]: 100: Hoare triple {15259#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15264#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:04,148 INFO L290 TraceCheckUtils]: 101: Hoare triple {15264#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15265#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:35:04,149 INFO L272 TraceCheckUtils]: 102: Hoare triple {15265#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:35:04,149 INFO L290 TraceCheckUtils]: 103: Hoare triple {15266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:35:04,149 INFO L290 TraceCheckUtils]: 104: Hoare triple {15267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15203#false} is VALID [2022-04-15 12:35:04,149 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-15 12:35:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 18 proven. 262 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 12:35:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:04,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923038469] [2022-04-15 12:35:04,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923038469] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:04,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192029056] [2022-04-15 12:35:04,150 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:35:04,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:04,151 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:35:04,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:35:04,316 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-04-15 12:35:04,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:04,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:35:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:04,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:04,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:35:11,110 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:35:11,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:35:11,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {15202#true} call ULTIMATE.init(); {15202#true} is VALID [2022-04-15 12:35:11,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {15202#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15202#true} is VALID [2022-04-15 12:35:11,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {15202#true} assume true; {15202#true} is VALID [2022-04-15 12:35:11,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15202#true} {15202#true} #70#return; {15202#true} is VALID [2022-04-15 12:35:11,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {15202#true} call #t~ret6 := main(); {15202#true} is VALID [2022-04-15 12:35:11,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {15202#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {15202#true} is VALID [2022-04-15 12:35:11,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {15202#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {15290#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:11,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {15290#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15290#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:11,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {15290#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15297#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:11,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {15297#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15297#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:11,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {15297#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15304#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:11,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {15304#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15304#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:11,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {15304#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15311#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:11,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {15311#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15311#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:11,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15318#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:11,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {15318#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15318#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:11,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {15318#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15325#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:11,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {15325#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15325#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:11,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {15325#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15332#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:11,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {15332#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15332#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:11,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {15332#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15339#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:11,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {15339#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15339#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:11,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {15339#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15346#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:11,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {15346#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15346#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:11,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {15346#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15353#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:11,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {15353#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {15357#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 9))} is VALID [2022-04-15 12:35:11,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {15357#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {15361#(exists ((v_main_~i~0_207 Int)) (and (<= main_~i~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {15361#(exists ((v_main_~i~0_207 Int)) (and (<= main_~i~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} assume !(~i~0 < ~n~0); {15365#(exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {15365#(exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9)))} ~i~1 := 0; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,223 INFO L272 TraceCheckUtils]: 30: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,227 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {15369#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,229 INFO L290 TraceCheckUtils]: 37: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,234 INFO L272 TraceCheckUtils]: 38: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,245 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {15395#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,250 INFO L272 TraceCheckUtils]: 46: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,252 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {15420#(and (<= 2 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,257 INFO L272 TraceCheckUtils]: 54: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,287 INFO L290 TraceCheckUtils]: 57: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,287 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,288 INFO L290 TraceCheckUtils]: 59: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,288 INFO L290 TraceCheckUtils]: 60: Hoare triple {15445#(and (<= 3 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,292 INFO L272 TraceCheckUtils]: 62: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,295 INFO L290 TraceCheckUtils]: 63: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,300 INFO L290 TraceCheckUtils]: 65: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,301 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,301 INFO L290 TraceCheckUtils]: 67: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {15470#(and (<= 4 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,306 INFO L272 TraceCheckUtils]: 70: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,307 INFO L290 TraceCheckUtils]: 71: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,313 INFO L290 TraceCheckUtils]: 73: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,313 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,314 INFO L290 TraceCheckUtils]: 75: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,314 INFO L290 TraceCheckUtils]: 76: Hoare triple {15495#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,315 INFO L290 TraceCheckUtils]: 77: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,317 INFO L272 TraceCheckUtils]: 78: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,320 INFO L290 TraceCheckUtils]: 79: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,320 INFO L290 TraceCheckUtils]: 80: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,321 INFO L290 TraceCheckUtils]: 81: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,321 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,322 INFO L290 TraceCheckUtils]: 83: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,322 INFO L290 TraceCheckUtils]: 84: Hoare triple {15520#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,323 INFO L290 TraceCheckUtils]: 85: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,327 INFO L272 TraceCheckUtils]: 86: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,327 INFO L290 TraceCheckUtils]: 87: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,328 INFO L290 TraceCheckUtils]: 88: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,330 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,331 INFO L290 TraceCheckUtils]: 91: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,332 INFO L290 TraceCheckUtils]: 92: Hoare triple {15545#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,332 INFO L290 TraceCheckUtils]: 93: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,339 INFO L272 TraceCheckUtils]: 94: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,341 INFO L290 TraceCheckUtils]: 95: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} ~cond := #in~cond; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,342 INFO L290 TraceCheckUtils]: 96: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume !(0 == ~cond); {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,342 INFO L290 TraceCheckUtils]: 97: Hoare triple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} assume true; {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} is VALID [2022-04-15 12:35:11,343 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {15376#(exists ((v_main_~x~0.base_BEFORE_CALL_45 Int) (v_main_~x~0.offset_BEFORE_CALL_45 Int) (v_main_~i~0_207 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_45) (+ (* 4 v_main_~i~0_207) v_main_~x~0.offset_BEFORE_CALL_45)) 0) (<= v_main_~i~0_207 9)))} {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #68#return; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,343 INFO L290 TraceCheckUtils]: 99: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} havoc #t~mem5; {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,344 INFO L290 TraceCheckUtils]: 100: Hoare triple {15570#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {15595#(and (<= 9 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} is VALID [2022-04-15 12:35:11,345 INFO L290 TraceCheckUtils]: 101: Hoare triple {15595#(and (<= 9 main_~i~1) (exists ((v_main_~i~0_207 Int)) (and (<= main_~n~0 (+ v_main_~i~0_207 1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_207))) 0) (<= v_main_~i~0_207 9))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {15265#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:35:11,345 INFO L272 TraceCheckUtils]: 102: Hoare triple {15265#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {15602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:35:11,345 INFO L290 TraceCheckUtils]: 103: Hoare triple {15602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:35:11,346 INFO L290 TraceCheckUtils]: 104: Hoare triple {15606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15203#false} is VALID [2022-04-15 12:35:11,346 INFO L290 TraceCheckUtils]: 105: Hoare triple {15203#false} assume !false; {15203#false} is VALID [2022-04-15 12:35:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 153 proven. 127 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 12:35:11,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:11,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192029056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:11,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:35:11,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-04-15 12:35:11,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:11,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230336076] [2022-04-15 12:35:11,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230336076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:11,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:11,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:35:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824516360] [2022-04-15 12:35:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:11,663 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 106 [2022-04-15 12:35:11,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:11,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:11,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:11,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:35:11,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:11,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:35:11,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2777, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 12:35:11,719 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:14,603 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2022-04-15 12:35:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:35:14,603 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 106 [2022-04-15 12:35:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-15 12:35:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 96 transitions. [2022-04-15 12:35:14,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 96 transitions. [2022-04-15 12:35:14,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:14,704 INFO L225 Difference]: With dead ends: 122 [2022-04-15 12:35:14,704 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 12:35:14,706 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 88 SyntacticMatches, 18 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=511, Invalid=6131, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:35:14,707 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 75 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:14,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 142 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:35:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 12:35:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-04-15 12:35:14,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:14,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:14,760 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:14,760 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:14,761 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-15 12:35:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-15 12:35:14,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:14,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:14,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-15 12:35:14,762 INFO L87 Difference]: Start difference. First operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-15 12:35:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:14,763 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-15 12:35:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-15 12:35:14,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:14,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:14,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:14,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.021978021978022) internal successors, (93), 92 states have internal predecessors, (93), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2022-04-15 12:35:14,765 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 106 [2022-04-15 12:35:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:14,766 INFO L478 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2022-04-15 12:35:14,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 11 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 12:35:14,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 118 transitions. [2022-04-15 12:35:14,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-15 12:35:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 12:35:14,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:14,965 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:14,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:35:15,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:15,181 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:15,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 37 times [2022-04-15 12:35:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:15,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929152542] [2022-04-15 12:35:15,184 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:35:15,184 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:35:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2058059454, now seen corresponding path program 38 times [2022-04-15 12:35:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:15,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283094864] [2022-04-15 12:35:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:35:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {16476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16408#true} is VALID [2022-04-15 12:35:15,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-15 12:35:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 12:35:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #68#return; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 12:35:15,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 12:35:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 12:35:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:15,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 12:35:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 12:35:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:15,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 12:35:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-15 12:35:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-15 12:35:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:15,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 12:35:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-15 12:35:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:15,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:35:15,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {16476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16408#true} is VALID [2022-04-15 12:35:15,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-15 12:35:15,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-15 12:35:15,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-15 12:35:15,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16413#(= main_~i~0 0)} is VALID [2022-04-15 12:35:15,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {16413#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16413#(= main_~i~0 0)} is VALID [2022-04-15 12:35:15,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {16413#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:15,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:15,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:15,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:15,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:15,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:15,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:15,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:15,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:15,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:15,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:15,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:15,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:15,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:15,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:15,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:15,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:15,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:15,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:15,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-15 12:35:15,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 12:35:15,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 12:35:15,448 INFO L272 TraceCheckUtils]: 30: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,448 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #68#return; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 12:35:15,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} havoc #t~mem5; {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} is VALID [2022-04-15 12:35:15,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {16425#(and (<= main_~n~0 10) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:15,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:15,449 INFO L272 TraceCheckUtils]: 38: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,463 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:15,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:15,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:15,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:15,464 INFO L272 TraceCheckUtils]: 46: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,465 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:15,465 INFO L290 TraceCheckUtils]: 51: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:15,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:15,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:15,465 INFO L272 TraceCheckUtils]: 54: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,466 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,466 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,466 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:15,466 INFO L290 TraceCheckUtils]: 59: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:15,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:15,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:15,467 INFO L272 TraceCheckUtils]: 62: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,467 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,467 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:15,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:15,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:15,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:15,468 INFO L272 TraceCheckUtils]: 70: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,468 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,469 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:15,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:15,469 INFO L290 TraceCheckUtils]: 76: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:15,469 INFO L290 TraceCheckUtils]: 77: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:15,469 INFO L272 TraceCheckUtils]: 78: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,469 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,469 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,470 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:15,470 INFO L290 TraceCheckUtils]: 83: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:15,470 INFO L290 TraceCheckUtils]: 84: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:15,471 INFO L290 TraceCheckUtils]: 85: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:15,471 INFO L272 TraceCheckUtils]: 86: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,471 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,471 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,471 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,471 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:15,471 INFO L290 TraceCheckUtils]: 91: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:15,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:15,472 INFO L290 TraceCheckUtils]: 93: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:15,472 INFO L272 TraceCheckUtils]: 94: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,472 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,472 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,472 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,472 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:15,473 INFO L290 TraceCheckUtils]: 99: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:15,473 INFO L290 TraceCheckUtils]: 100: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:15,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:15,473 INFO L272 TraceCheckUtils]: 102: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:15,473 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:15,473 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:15,473 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:15,474 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:15,474 INFO L290 TraceCheckUtils]: 107: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:15,474 INFO L290 TraceCheckUtils]: 108: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16475#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:35:15,475 INFO L290 TraceCheckUtils]: 109: Hoare triple {16475#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-15 12:35:15,475 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-15 12:35:15,475 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-15 12:35:15,475 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-15 12:35:15,475 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-15 12:35:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 183 proven. 137 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 12:35:15,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:15,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283094864] [2022-04-15 12:35:15,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283094864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:15,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201149505] [2022-04-15 12:35:15,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:35:15,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:15,477 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:35:15,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:35:15,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:35:15,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:15,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:35:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:15,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:16,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-15 12:35:16,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16408#true} is VALID [2022-04-15 12:35:16,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-15 12:35:16,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-15 12:35:16,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-15 12:35:16,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16498#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:16,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {16498#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16498#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:16,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {16498#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:16,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:16,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:16,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:16,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:16,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:16,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:16,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:16,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:16,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:16,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:16,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:16,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:16,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:16,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:16,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:16,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:16,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:16,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:16,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-15 12:35:16,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-15 12:35:16,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-15 12:35:16,115 INFO L272 TraceCheckUtils]: 30: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,116 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} #68#return; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-15 12:35:16,116 INFO L290 TraceCheckUtils]: 35: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} havoc #t~mem5; {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} is VALID [2022-04-15 12:35:16,116 INFO L290 TraceCheckUtils]: 36: Hoare triple {16565#(and (<= main_~n~0 10) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,117 INFO L272 TraceCheckUtils]: 38: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,117 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,117 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} #68#return; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} havoc #t~mem5; {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {16590#(and (<= 1 main_~i~1) (<= main_~n~0 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:16,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:16,118 INFO L272 TraceCheckUtils]: 46: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,119 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} #68#return; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:16,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} havoc #t~mem5; {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:16,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {16615#(and (<= main_~n~0 10) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:16,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:16,119 INFO L272 TraceCheckUtils]: 54: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,120 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,120 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} #68#return; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:16,120 INFO L290 TraceCheckUtils]: 59: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} havoc #t~mem5; {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:16,121 INFO L290 TraceCheckUtils]: 60: Hoare triple {16640#(and (<= main_~n~0 10) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:16,121 INFO L290 TraceCheckUtils]: 61: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:16,121 INFO L272 TraceCheckUtils]: 62: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,121 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,121 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,121 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,121 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} #68#return; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:16,122 INFO L290 TraceCheckUtils]: 67: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} havoc #t~mem5; {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:16,122 INFO L290 TraceCheckUtils]: 68: Hoare triple {16665#(and (<= main_~n~0 10) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-15 12:35:16,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-15 12:35:16,122 INFO L272 TraceCheckUtils]: 70: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,122 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,122 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,123 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,123 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} #68#return; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-15 12:35:16,123 INFO L290 TraceCheckUtils]: 75: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} havoc #t~mem5; {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} is VALID [2022-04-15 12:35:16,123 INFO L290 TraceCheckUtils]: 76: Hoare triple {16690#(and (<= main_~n~0 10) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,124 INFO L290 TraceCheckUtils]: 77: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,124 INFO L272 TraceCheckUtils]: 78: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,124 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,124 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,124 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,124 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} #68#return; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,124 INFO L290 TraceCheckUtils]: 83: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} havoc #t~mem5; {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,125 INFO L290 TraceCheckUtils]: 84: Hoare triple {16715#(and (<= 6 main_~i~1) (<= main_~n~0 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-15 12:35:16,125 INFO L290 TraceCheckUtils]: 85: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-15 12:35:16,125 INFO L272 TraceCheckUtils]: 86: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,125 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,125 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,125 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,126 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} #68#return; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-15 12:35:16,126 INFO L290 TraceCheckUtils]: 91: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} havoc #t~mem5; {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} is VALID [2022-04-15 12:35:16,126 INFO L290 TraceCheckUtils]: 92: Hoare triple {16740#(and (<= main_~n~0 10) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-15 12:35:16,126 INFO L290 TraceCheckUtils]: 93: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-15 12:35:16,127 INFO L272 TraceCheckUtils]: 94: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,127 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,127 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,127 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,127 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} #68#return; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-15 12:35:16,127 INFO L290 TraceCheckUtils]: 99: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} havoc #t~mem5; {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} is VALID [2022-04-15 12:35:16,128 INFO L290 TraceCheckUtils]: 100: Hoare triple {16765#(and (<= main_~n~0 10) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:16,128 INFO L290 TraceCheckUtils]: 101: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:16,128 INFO L272 TraceCheckUtils]: 102: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,128 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,128 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,128 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,128 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} #68#return; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:16,129 INFO L290 TraceCheckUtils]: 107: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} havoc #t~mem5; {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:16,129 INFO L290 TraceCheckUtils]: 108: Hoare triple {16790#(and (<= main_~n~0 10) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16815#(and (<= 10 main_~i~1) (<= main_~n~0 10))} is VALID [2022-04-15 12:35:16,129 INFO L290 TraceCheckUtils]: 109: Hoare triple {16815#(and (<= 10 main_~i~1) (<= main_~n~0 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-15 12:35:16,129 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-15 12:35:16,130 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-15 12:35:16,130 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-15 12:35:16,130 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-15 12:35:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 220 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 12:35:16,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:16,423 INFO L290 TraceCheckUtils]: 113: Hoare triple {16409#false} assume !false; {16409#false} is VALID [2022-04-15 12:35:16,423 INFO L290 TraceCheckUtils]: 112: Hoare triple {16409#false} assume 0 == ~cond; {16409#false} is VALID [2022-04-15 12:35:16,423 INFO L290 TraceCheckUtils]: 111: Hoare triple {16409#false} ~cond := #in~cond; {16409#false} is VALID [2022-04-15 12:35:16,423 INFO L272 TraceCheckUtils]: 110: Hoare triple {16409#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16409#false} is VALID [2022-04-15 12:35:16,423 INFO L290 TraceCheckUtils]: 109: Hoare triple {16475#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16409#false} is VALID [2022-04-15 12:35:16,424 INFO L290 TraceCheckUtils]: 108: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16475#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:35:16,424 INFO L290 TraceCheckUtils]: 107: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:16,424 INFO L284 TraceCheckUtils]: 106: Hoare quadruple {16408#true} {16470#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:16,424 INFO L290 TraceCheckUtils]: 105: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,424 INFO L290 TraceCheckUtils]: 104: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,425 INFO L290 TraceCheckUtils]: 103: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,425 INFO L272 TraceCheckUtils]: 102: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,425 INFO L290 TraceCheckUtils]: 101: Hoare triple {16470#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:16,432 INFO L290 TraceCheckUtils]: 100: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16470#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:16,432 INFO L290 TraceCheckUtils]: 99: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:16,432 INFO L284 TraceCheckUtils]: 98: Hoare quadruple {16408#true} {16465#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:16,432 INFO L290 TraceCheckUtils]: 97: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,432 INFO L290 TraceCheckUtils]: 96: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,433 INFO L290 TraceCheckUtils]: 95: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,433 INFO L272 TraceCheckUtils]: 94: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,433 INFO L290 TraceCheckUtils]: 93: Hoare triple {16465#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:16,433 INFO L290 TraceCheckUtils]: 92: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16465#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:16,433 INFO L290 TraceCheckUtils]: 91: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:16,434 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16408#true} {16460#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:16,434 INFO L290 TraceCheckUtils]: 89: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,434 INFO L290 TraceCheckUtils]: 88: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,434 INFO L290 TraceCheckUtils]: 87: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,434 INFO L272 TraceCheckUtils]: 86: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {16460#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:16,435 INFO L290 TraceCheckUtils]: 84: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16460#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:16,435 INFO L290 TraceCheckUtils]: 83: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:16,435 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {16408#true} {16455#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:16,435 INFO L290 TraceCheckUtils]: 81: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,435 INFO L290 TraceCheckUtils]: 80: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,435 INFO L290 TraceCheckUtils]: 79: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,435 INFO L272 TraceCheckUtils]: 78: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,436 INFO L290 TraceCheckUtils]: 77: Hoare triple {16455#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:16,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16455#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:16,436 INFO L290 TraceCheckUtils]: 75: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:16,436 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16408#true} {16450#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:16,436 INFO L290 TraceCheckUtils]: 73: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,436 INFO L290 TraceCheckUtils]: 72: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,437 INFO L272 TraceCheckUtils]: 70: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,447 INFO L290 TraceCheckUtils]: 69: Hoare triple {16450#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:16,447 INFO L290 TraceCheckUtils]: 68: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16450#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:16,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:16,448 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16408#true} {16445#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:16,448 INFO L290 TraceCheckUtils]: 65: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,449 INFO L272 TraceCheckUtils]: 62: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {16445#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:16,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16445#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:16,450 INFO L290 TraceCheckUtils]: 59: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:16,450 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16408#true} {16440#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:16,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,450 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,451 INFO L272 TraceCheckUtils]: 54: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {16440#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:16,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16440#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:16,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:16,452 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16408#true} {16435#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:16,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,452 INFO L272 TraceCheckUtils]: 46: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {16435#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:16,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16435#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:16,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:16,454 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {16408#true} {16430#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:16,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,454 INFO L272 TraceCheckUtils]: 38: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {16430#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:16,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {16430#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:16,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:16,456 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {16408#true} {17062#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:16,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {16408#true} assume !(0 == ~cond); {16408#true} is VALID [2022-04-15 12:35:16,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {16408#true} ~cond := #in~cond; {16408#true} is VALID [2022-04-15 12:35:16,456 INFO L272 TraceCheckUtils]: 30: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {16408#true} is VALID [2022-04-15 12:35:16,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {17062#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:16,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {16424#(<= main_~n~0 10)} ~i~1 := 0; {17062#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:16,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {16423#(<= main_~i~0 10)} assume !(~i~0 < ~n~0); {16424#(<= main_~n~0 10)} is VALID [2022-04-15 12:35:16,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {16422#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16423#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:16,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {16422#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16422#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:16,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {16421#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16422#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:16,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {16421#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16421#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:16,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {16420#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16421#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:16,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {16420#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16420#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:16,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {16419#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16420#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:16,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {16419#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16419#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:16,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {16418#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16419#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:16,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {16418#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16418#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:16,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {16417#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16418#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:16,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {16417#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16417#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:16,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {16416#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16417#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:16,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {16416#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16416#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:16,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {16415#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16416#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:16,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {16415#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16415#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:16,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {16414#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16415#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:16,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {16414#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16414#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:16,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {16498#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16414#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:16,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {16498#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {16498#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:16,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {16408#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {16498#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:16,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {16408#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {16408#true} is VALID [2022-04-15 12:35:16,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {16408#true} call #t~ret6 := main(); {16408#true} is VALID [2022-04-15 12:35:16,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16408#true} {16408#true} #70#return; {16408#true} is VALID [2022-04-15 12:35:16,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {16408#true} assume true; {16408#true} is VALID [2022-04-15 12:35:16,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {16408#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {16408#true} is VALID [2022-04-15 12:35:16,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {16408#true} call ULTIMATE.init(); {16408#true} is VALID [2022-04-15 12:35:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 220 proven. 100 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 12:35:16,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201149505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:35:16,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:35:16,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 39 [2022-04-15 12:35:16,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:16,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929152542] [2022-04-15 12:35:16,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929152542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:16,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:16,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:35:16,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559965919] [2022-04-15 12:35:16,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 114 [2022-04-15 12:35:16,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:16,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:16,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:16,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:35:16,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:16,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:35:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:35:16,519 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:17,414 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2022-04-15 12:35:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:35:17,414 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 114 [2022-04-15 12:35:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-15 12:35:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 106 transitions. [2022-04-15 12:35:17,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 106 transitions. [2022-04-15 12:35:17,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:17,495 INFO L225 Difference]: With dead ends: 172 [2022-04-15 12:35:17,495 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 12:35:17,496 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=682, Invalid=3100, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 12:35:17,496 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:17,497 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 65 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:35:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 12:35:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-04-15 12:35:17,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:17,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:17,555 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:17,555 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:17,556 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-15 12:35:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-15 12:35:17,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:17,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:17,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-15 12:35:17,557 INFO L87 Difference]: Start difference. First operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-15 12:35:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:17,558 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-04-15 12:35:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2022-04-15 12:35:17,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:17,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:17,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:17,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.021505376344086) internal successors, (95), 94 states have internal predecessors, (95), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-15 12:35:17,560 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-04-15 12:35:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:17,560 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-15 12:35:17,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:17,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-15 12:35:17,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 12:35:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 12:35:17,707 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:17,707 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:17,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:35:17,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 12:35:17,923 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:17,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:17,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 39 times [2022-04-15 12:35:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:17,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590634442] [2022-04-15 12:35:17,926 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:35:17,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:35:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1880118428, now seen corresponding path program 40 times [2022-04-15 12:35:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:17,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684505577] [2022-04-15 12:35:17,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:35:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {18113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18041#true} is VALID [2022-04-15 12:35:18,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-15 12:35:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 12:35:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #68#return; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 12:35:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 12:35:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 12:35:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 12:35:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:18,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 12:35:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-15 12:35:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-15 12:35:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-15 12:35:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-15 12:35:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:18,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {18041#true} call ULTIMATE.init(); {18113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:35:18,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {18113#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18041#true} is VALID [2022-04-15 12:35:18,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-15 12:35:18,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-15 12:35:18,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {18041#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18041#true} is VALID [2022-04-15 12:35:18,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {18041#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {18046#(= main_~i~0 0)} is VALID [2022-04-15 12:35:18,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {18046#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18046#(= main_~i~0 0)} is VALID [2022-04-15 12:35:18,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {18046#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:35:18,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:35:18,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {18047#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:35:18,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:35:18,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {18048#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:35:18,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:35:18,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {18049#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:35:18,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:35:18,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {18050#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:35:18,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:35:18,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {18051#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:35:18,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:35:18,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {18052#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:35:18,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:35:18,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {18053#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:35:18,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:35:18,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {18054#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:35:18,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:35:18,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {18055#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18056#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:35:18,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {18056#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18057#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:35:18,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {18057#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} is VALID [2022-04-15 12:35:18,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} assume !(~i~0 < ~n~0); {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} is VALID [2022-04-15 12:35:18,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {18058#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0)} ~i~1 := 0; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:18,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:18,421 INFO L272 TraceCheckUtils]: 32: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,421 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18041#true} {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #68#return; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:18,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} havoc #t~mem5; {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} is VALID [2022-04-15 12:35:18,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {18059#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40)) 0) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:18,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:18,423 INFO L272 TraceCheckUtils]: 40: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,423 INFO L290 TraceCheckUtils]: 43: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,423 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18041#true} {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:18,424 INFO L290 TraceCheckUtils]: 45: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:18,424 INFO L290 TraceCheckUtils]: 46: Hoare triple {18064#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,425 INFO L272 TraceCheckUtils]: 48: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,425 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18041#true} {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {18069#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:18,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:18,427 INFO L272 TraceCheckUtils]: 56: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,427 INFO L290 TraceCheckUtils]: 57: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,427 INFO L290 TraceCheckUtils]: 58: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,427 INFO L290 TraceCheckUtils]: 59: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,427 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18041#true} {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:18,428 INFO L290 TraceCheckUtils]: 61: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:18,428 INFO L290 TraceCheckUtils]: 62: Hoare triple {18074#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:18,429 INFO L290 TraceCheckUtils]: 63: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:18,429 INFO L272 TraceCheckUtils]: 64: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,429 INFO L290 TraceCheckUtils]: 67: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,429 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18041#true} {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:18,430 INFO L290 TraceCheckUtils]: 69: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:18,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {18079#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:18,431 INFO L290 TraceCheckUtils]: 71: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:18,431 INFO L272 TraceCheckUtils]: 72: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,431 INFO L290 TraceCheckUtils]: 73: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,431 INFO L290 TraceCheckUtils]: 74: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,431 INFO L290 TraceCheckUtils]: 75: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,431 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18041#true} {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:18,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:18,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {18084#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,433 INFO L290 TraceCheckUtils]: 79: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,433 INFO L272 TraceCheckUtils]: 80: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,433 INFO L290 TraceCheckUtils]: 81: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,433 INFO L290 TraceCheckUtils]: 83: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,433 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18041#true} {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {18089#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:18,435 INFO L290 TraceCheckUtils]: 87: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:18,435 INFO L272 TraceCheckUtils]: 88: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,435 INFO L290 TraceCheckUtils]: 89: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,435 INFO L290 TraceCheckUtils]: 90: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,435 INFO L290 TraceCheckUtils]: 91: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,436 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18041#true} {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:18,436 INFO L290 TraceCheckUtils]: 93: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:18,436 INFO L290 TraceCheckUtils]: 94: Hoare triple {18094#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:18,437 INFO L290 TraceCheckUtils]: 95: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:18,437 INFO L272 TraceCheckUtils]: 96: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,437 INFO L290 TraceCheckUtils]: 97: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,437 INFO L290 TraceCheckUtils]: 98: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,437 INFO L290 TraceCheckUtils]: 99: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,438 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18041#true} {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:18,438 INFO L290 TraceCheckUtils]: 101: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:18,438 INFO L290 TraceCheckUtils]: 102: Hoare triple {18099#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:18,439 INFO L290 TraceCheckUtils]: 103: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:18,439 INFO L272 TraceCheckUtils]: 104: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18041#true} is VALID [2022-04-15 12:35:18,439 INFO L290 TraceCheckUtils]: 105: Hoare triple {18041#true} ~cond := #in~cond; {18041#true} is VALID [2022-04-15 12:35:18,439 INFO L290 TraceCheckUtils]: 106: Hoare triple {18041#true} assume !(0 == ~cond); {18041#true} is VALID [2022-04-15 12:35:18,439 INFO L290 TraceCheckUtils]: 107: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:18,440 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18041#true} {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:18,440 INFO L290 TraceCheckUtils]: 109: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:18,440 INFO L290 TraceCheckUtils]: 110: Hoare triple {18104#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18109#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:18,441 INFO L290 TraceCheckUtils]: 111: Hoare triple {18109#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18110#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:35:18,441 INFO L272 TraceCheckUtils]: 112: Hoare triple {18110#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:35:18,441 INFO L290 TraceCheckUtils]: 113: Hoare triple {18111#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18112#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:35:18,442 INFO L290 TraceCheckUtils]: 114: Hoare triple {18112#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18042#false} is VALID [2022-04-15 12:35:18,442 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-15 12:35:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 20 proven. 321 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 12:35:18,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:18,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684505577] [2022-04-15 12:35:18,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684505577] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:18,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117525446] [2022-04-15 12:35:18,443 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:35:18,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:18,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:18,444 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:35:18,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:35:18,593 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:35:18,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:18,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 12:35:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:18,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:18,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:35:27,016 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:35:27,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:35:27,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {18041#true} call ULTIMATE.init(); {18041#true} is VALID [2022-04-15 12:35:27,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18041#true} is VALID [2022-04-15 12:35:27,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {18041#true} assume true; {18041#true} is VALID [2022-04-15 12:35:27,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18041#true} {18041#true} #70#return; {18041#true} is VALID [2022-04-15 12:35:27,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {18041#true} call #t~ret6 := main(); {18041#true} is VALID [2022-04-15 12:35:27,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {18041#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {18041#true} is VALID [2022-04-15 12:35:27,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {18041#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {18135#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:27,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {18135#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18135#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:27,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {18135#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18142#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:27,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {18142#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18142#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:27,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {18142#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18149#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:27,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {18149#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18149#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:27,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {18149#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18156#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:27,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {18156#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18156#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:27,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {18156#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18163#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:27,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {18163#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18163#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:27,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {18163#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18170#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:27,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {18170#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18170#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:27,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {18170#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18177#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:27,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {18177#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18177#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:27,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {18177#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18184#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:27,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {18184#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18184#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:27,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {18184#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18191#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:27,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {18191#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18191#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:27,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {18191#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18198#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:27,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {18198#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18198#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:27,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {18198#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18205#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:27,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {18205#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {18209#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10))} is VALID [2022-04-15 12:35:27,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {18209#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 10))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18213#(exists ((v_main_~i~0_243 Int)) (and (<= main_~i~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} is VALID [2022-04-15 12:35:27,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {18213#(exists ((v_main_~i~0_243 Int)) (and (<= main_~i~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} assume !(~i~0 < ~n~0); {18217#(exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} is VALID [2022-04-15 12:35:27,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {18217#(exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10)))} ~i~1 := 0; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,106 INFO L272 TraceCheckUtils]: 32: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,115 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {18221#(and (<= 0 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,117 INFO L290 TraceCheckUtils]: 39: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,118 INFO L272 TraceCheckUtils]: 40: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,133 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {18247#(and (<= 1 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:27,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:27,136 INFO L272 TraceCheckUtils]: 48: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,138 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} #68#return; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:27,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} havoc #t~mem5; {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:35:27,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {18272#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:27,140 INFO L290 TraceCheckUtils]: 55: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:27,141 INFO L272 TraceCheckUtils]: 56: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,152 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} #68#return; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:27,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} havoc #t~mem5; {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:35:27,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {18297#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:27,154 INFO L290 TraceCheckUtils]: 63: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:27,155 INFO L272 TraceCheckUtils]: 64: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,159 INFO L290 TraceCheckUtils]: 65: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,160 INFO L290 TraceCheckUtils]: 66: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,160 INFO L290 TraceCheckUtils]: 67: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,161 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} #68#return; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:27,162 INFO L290 TraceCheckUtils]: 69: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} havoc #t~mem5; {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:35:27,162 INFO L290 TraceCheckUtils]: 70: Hoare triple {18322#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,164 INFO L272 TraceCheckUtils]: 72: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,165 INFO L290 TraceCheckUtils]: 74: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,170 INFO L290 TraceCheckUtils]: 75: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,170 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,171 INFO L290 TraceCheckUtils]: 77: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {18347#(and (<= 5 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,172 INFO L290 TraceCheckUtils]: 79: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,173 INFO L272 TraceCheckUtils]: 80: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,175 INFO L290 TraceCheckUtils]: 81: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,175 INFO L290 TraceCheckUtils]: 82: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,183 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,185 INFO L290 TraceCheckUtils]: 86: Hoare triple {18372#(and (<= 6 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,185 INFO L290 TraceCheckUtils]: 87: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,186 INFO L272 TraceCheckUtils]: 88: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,189 INFO L290 TraceCheckUtils]: 90: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,196 INFO L290 TraceCheckUtils]: 91: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,197 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,197 INFO L290 TraceCheckUtils]: 93: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,198 INFO L290 TraceCheckUtils]: 94: Hoare triple {18397#(and (<= 7 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,199 INFO L290 TraceCheckUtils]: 95: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,199 INFO L272 TraceCheckUtils]: 96: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,203 INFO L290 TraceCheckUtils]: 97: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,210 INFO L290 TraceCheckUtils]: 98: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,210 INFO L290 TraceCheckUtils]: 99: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,211 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #68#return; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,211 INFO L290 TraceCheckUtils]: 101: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} havoc #t~mem5; {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,212 INFO L290 TraceCheckUtils]: 102: Hoare triple {18422#(and (<= 8 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:27,213 INFO L290 TraceCheckUtils]: 103: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:27,213 INFO L272 TraceCheckUtils]: 104: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,214 INFO L290 TraceCheckUtils]: 105: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} ~cond := #in~cond; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,214 INFO L290 TraceCheckUtils]: 106: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume !(0 == ~cond); {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,215 INFO L290 TraceCheckUtils]: 107: Hoare triple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} assume true; {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} is VALID [2022-04-15 12:35:27,215 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {18228#(exists ((v_main_~i~0_243 Int) (v_main_~x~0.base_BEFORE_CALL_54 Int) (v_main_~x~0.offset_BEFORE_CALL_54 Int)) (and (<= v_main_~i~0_243 10) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_54) (+ (* 4 v_main_~i~0_243) v_main_~x~0.offset_BEFORE_CALL_54)) 0)))} {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} #68#return; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:27,216 INFO L290 TraceCheckUtils]: 109: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} havoc #t~mem5; {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} is VALID [2022-04-15 12:35:27,217 INFO L290 TraceCheckUtils]: 110: Hoare triple {18447#(and (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {18472#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} is VALID [2022-04-15 12:35:27,217 INFO L290 TraceCheckUtils]: 111: Hoare triple {18472#(and (<= 10 main_~i~1) (exists ((v_main_~i~0_243 Int)) (and (<= main_~n~0 (+ v_main_~i~0_243 1)) (= (select (select |#memory_int| main_~x~0.base) (+ (* 4 v_main_~i~0_243) main_~x~0.offset)) 0) (<= v_main_~i~0_243 10))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {18110#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:35:27,218 INFO L272 TraceCheckUtils]: 112: Hoare triple {18110#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {18479#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:35:27,218 INFO L290 TraceCheckUtils]: 113: Hoare triple {18479#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18483#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:35:27,218 INFO L290 TraceCheckUtils]: 114: Hoare triple {18483#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18042#false} is VALID [2022-04-15 12:35:27,218 INFO L290 TraceCheckUtils]: 115: Hoare triple {18042#false} assume !false; {18042#false} is VALID [2022-04-15 12:35:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 190 proven. 151 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 12:35:27,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:27,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117525446] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:27,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:35:27,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 58 [2022-04-15 12:35:27,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:27,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [590634442] [2022-04-15 12:35:27,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [590634442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:27,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:27,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:35:27,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421714182] [2022-04-15 12:35:27,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:27,699 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 116 [2022-04-15 12:35:27,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:27,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:27,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:27,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:35:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:27,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:35:27,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3195, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:35:27,744 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:30,626 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-04-15 12:35:30,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:35:30,626 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Word has length 116 [2022-04-15 12:35:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-15 12:35:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 103 transitions. [2022-04-15 12:35:30,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 103 transitions. [2022-04-15 12:35:30,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:30,698 INFO L225 Difference]: With dead ends: 132 [2022-04-15 12:35:30,698 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 12:35:30,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 96 SyntacticMatches, 20 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=575, Invalid=7081, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 12:35:30,699 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 80 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:30,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 153 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 12:35:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 12:35:30,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-15 12:35:30,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:30,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:35:30,752 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:35:30,752 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:35:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:30,753 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-15 12:35:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 12:35:30,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:30,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:30,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-15 12:35:30,767 INFO L87 Difference]: Start difference. First operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-15 12:35:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:30,769 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-15 12:35:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 12:35:30,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:30,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:30,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:30,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:35:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-15 12:35:30,771 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 116 [2022-04-15 12:35:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:30,771 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-15 12:35:30,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 28 states have internal predecessors, (65), 12 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 12:35:30,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-15 12:35:30,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-15 12:35:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 12:35:30,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:30,922 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:30,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:35:31,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 12:35:31,123 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 41 times [2022-04-15 12:35:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:31,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [651723240] [2022-04-15 12:35:31,125 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:35:31,125 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:35:31,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1566810506, now seen corresponding path program 42 times [2022-04-15 12:35:31,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:31,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46204010] [2022-04-15 12:35:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:31,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:35:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {19423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19349#true} is VALID [2022-04-15 12:35:31,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-15 12:35:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 12:35:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #68#return; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 12:35:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:31,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 12:35:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 12:35:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:31,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 12:35:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 12:35:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-15 12:35:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-15 12:35:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-15 12:35:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:31,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-15 12:35:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-15 12:35:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:31,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:35:31,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {19423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19349#true} is VALID [2022-04-15 12:35:31,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-15 12:35:31,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-15 12:35:31,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-15 12:35:31,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19354#(= main_~i~0 0)} is VALID [2022-04-15 12:35:31,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {19354#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19354#(= main_~i~0 0)} is VALID [2022-04-15 12:35:31,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {19354#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:31,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:31,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:31,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:31,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:31,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:31,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:31,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:31,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:31,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:31,375 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:31,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:31,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:31,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:31,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:31,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:31,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:31,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:31,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:31,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:31,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-15 12:35:31,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-15 12:35:31,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:31,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:31,378 INFO L272 TraceCheckUtils]: 32: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,379 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #68#return; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:31,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} havoc #t~mem5; {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:31,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {19367#(and (= main_~i~1 0) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:31,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:31,379 INFO L272 TraceCheckUtils]: 40: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,380 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:31,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:31,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:31,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:31,381 INFO L272 TraceCheckUtils]: 48: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,381 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:31,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:31,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:31,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:31,382 INFO L272 TraceCheckUtils]: 56: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,383 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:31,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:31,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:31,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:31,383 INFO L272 TraceCheckUtils]: 64: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,384 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:31,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:31,384 INFO L290 TraceCheckUtils]: 70: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:31,385 INFO L290 TraceCheckUtils]: 71: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:31,385 INFO L272 TraceCheckUtils]: 72: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,385 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,385 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,385 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,385 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:31,385 INFO L290 TraceCheckUtils]: 77: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:31,386 INFO L290 TraceCheckUtils]: 78: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:31,386 INFO L290 TraceCheckUtils]: 79: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:31,386 INFO L272 TraceCheckUtils]: 80: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,386 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,386 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,386 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,387 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:31,387 INFO L290 TraceCheckUtils]: 85: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:31,387 INFO L290 TraceCheckUtils]: 86: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:31,387 INFO L290 TraceCheckUtils]: 87: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:31,387 INFO L272 TraceCheckUtils]: 88: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,387 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,387 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,388 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,388 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:31,388 INFO L290 TraceCheckUtils]: 93: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:31,388 INFO L290 TraceCheckUtils]: 94: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:31,389 INFO L290 TraceCheckUtils]: 95: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:31,389 INFO L272 TraceCheckUtils]: 96: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,389 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,389 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,389 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,389 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:31,389 INFO L290 TraceCheckUtils]: 101: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:31,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:31,390 INFO L290 TraceCheckUtils]: 103: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:31,390 INFO L272 TraceCheckUtils]: 104: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,390 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,390 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,390 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,391 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:31,391 INFO L290 TraceCheckUtils]: 109: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:31,391 INFO L290 TraceCheckUtils]: 110: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:31,391 INFO L290 TraceCheckUtils]: 111: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:31,391 INFO L272 TraceCheckUtils]: 112: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:31,391 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:31,392 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:31,392 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:31,401 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:31,401 INFO L290 TraceCheckUtils]: 117: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:31,401 INFO L290 TraceCheckUtils]: 118: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19422#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:35:31,401 INFO L290 TraceCheckUtils]: 119: Hoare triple {19422#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-15 12:35:31,402 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-15 12:35:31,402 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-15 12:35:31,402 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-15 12:35:31,402 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-15 12:35:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 223 proven. 162 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 12:35:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:31,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46204010] [2022-04-15 12:35:31,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46204010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:31,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886991806] [2022-04-15 12:35:31,403 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:35:31,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:31,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:31,404 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:35:31,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:35:31,557 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-15 12:35:31,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:31,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 12:35:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:31,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:32,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-15 12:35:32,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19349#true} is VALID [2022-04-15 12:35:32,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-15 12:35:32,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-15 12:35:32,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-15 12:35:32,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19445#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:32,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {19445#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19445#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:32,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {19445#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:32,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:32,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:32,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:32,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:32,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:32,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:32,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:32,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:32,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:32,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:32,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:32,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:32,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:32,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:32,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:32,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:32,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:32,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:32,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:32,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-15 12:35:32,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-15 12:35:32,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,394 INFO L272 TraceCheckUtils]: 32: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,394 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} #68#return; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {19518#(and (<= 0 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,395 INFO L272 TraceCheckUtils]: 40: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,396 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} #68#return; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {19543#(and (<= 1 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,397 INFO L272 TraceCheckUtils]: 48: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,397 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} #68#return; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,398 INFO L290 TraceCheckUtils]: 54: Hoare triple {19568#(and (<= 2 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,398 INFO L272 TraceCheckUtils]: 56: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,399 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} #68#return; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,399 INFO L290 TraceCheckUtils]: 61: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,399 INFO L290 TraceCheckUtils]: 62: Hoare triple {19593#(and (<= 3 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,399 INFO L290 TraceCheckUtils]: 63: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,399 INFO L272 TraceCheckUtils]: 64: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,400 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,400 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,400 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,400 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} #68#return; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {19618#(and (<= 4 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,401 INFO L290 TraceCheckUtils]: 71: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,401 INFO L272 TraceCheckUtils]: 72: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,401 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,401 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} #68#return; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,402 INFO L290 TraceCheckUtils]: 77: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,402 INFO L290 TraceCheckUtils]: 78: Hoare triple {19643#(and (<= 5 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,402 INFO L290 TraceCheckUtils]: 79: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,402 INFO L272 TraceCheckUtils]: 80: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,402 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,402 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,402 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,403 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} #68#return; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,403 INFO L290 TraceCheckUtils]: 85: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {19668#(and (<= 6 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,403 INFO L290 TraceCheckUtils]: 87: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,404 INFO L272 TraceCheckUtils]: 88: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,404 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,404 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,404 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,404 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} #68#return; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,404 INFO L290 TraceCheckUtils]: 93: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,405 INFO L290 TraceCheckUtils]: 94: Hoare triple {19693#(and (<= 7 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,405 INFO L290 TraceCheckUtils]: 95: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,405 INFO L272 TraceCheckUtils]: 96: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,405 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,405 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,405 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,405 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} #68#return; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,406 INFO L290 TraceCheckUtils]: 101: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,406 INFO L290 TraceCheckUtils]: 102: Hoare triple {19718#(and (<= 8 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,406 INFO L290 TraceCheckUtils]: 103: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,406 INFO L272 TraceCheckUtils]: 104: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,406 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,406 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,407 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,407 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} #68#return; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,407 INFO L290 TraceCheckUtils]: 109: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,407 INFO L290 TraceCheckUtils]: 110: Hoare triple {19743#(and (<= 9 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,408 INFO L290 TraceCheckUtils]: 111: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,408 INFO L272 TraceCheckUtils]: 112: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,408 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,408 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,408 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,408 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} #68#return; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,409 INFO L290 TraceCheckUtils]: 117: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} havoc #t~mem5; {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,409 INFO L290 TraceCheckUtils]: 118: Hoare triple {19768#(and (<= 10 main_~i~1) (<= main_~n~0 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19793#(and (<= 11 main_~i~1) (<= main_~n~0 11))} is VALID [2022-04-15 12:35:32,409 INFO L290 TraceCheckUtils]: 119: Hoare triple {19793#(and (<= 11 main_~i~1) (<= main_~n~0 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-15 12:35:32,409 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-15 12:35:32,409 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-15 12:35:32,409 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-15 12:35:32,409 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-15 12:35:32,410 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 264 proven. 121 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 12:35:32,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:32,834 INFO L290 TraceCheckUtils]: 123: Hoare triple {19350#false} assume !false; {19350#false} is VALID [2022-04-15 12:35:32,834 INFO L290 TraceCheckUtils]: 122: Hoare triple {19350#false} assume 0 == ~cond; {19350#false} is VALID [2022-04-15 12:35:32,834 INFO L290 TraceCheckUtils]: 121: Hoare triple {19350#false} ~cond := #in~cond; {19350#false} is VALID [2022-04-15 12:35:32,835 INFO L272 TraceCheckUtils]: 120: Hoare triple {19350#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19350#false} is VALID [2022-04-15 12:35:32,835 INFO L290 TraceCheckUtils]: 119: Hoare triple {19422#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19350#false} is VALID [2022-04-15 12:35:32,835 INFO L290 TraceCheckUtils]: 118: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19422#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:35:32,836 INFO L290 TraceCheckUtils]: 117: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:32,836 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {19349#true} {19417#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:32,836 INFO L290 TraceCheckUtils]: 115: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,836 INFO L290 TraceCheckUtils]: 114: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,836 INFO L290 TraceCheckUtils]: 113: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,836 INFO L272 TraceCheckUtils]: 112: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,837 INFO L290 TraceCheckUtils]: 111: Hoare triple {19417#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:32,837 INFO L290 TraceCheckUtils]: 110: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19417#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:35:32,837 INFO L290 TraceCheckUtils]: 109: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:32,838 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19349#true} {19412#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:32,838 INFO L290 TraceCheckUtils]: 107: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,838 INFO L290 TraceCheckUtils]: 106: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,838 INFO L290 TraceCheckUtils]: 105: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,838 INFO L272 TraceCheckUtils]: 104: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,838 INFO L290 TraceCheckUtils]: 103: Hoare triple {19412#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:32,839 INFO L290 TraceCheckUtils]: 102: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19412#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:35:32,839 INFO L290 TraceCheckUtils]: 101: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:32,840 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {19349#true} {19407#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:32,840 INFO L290 TraceCheckUtils]: 99: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,840 INFO L290 TraceCheckUtils]: 98: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,840 INFO L290 TraceCheckUtils]: 97: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,840 INFO L272 TraceCheckUtils]: 96: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,842 INFO L290 TraceCheckUtils]: 95: Hoare triple {19407#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:32,842 INFO L290 TraceCheckUtils]: 94: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19407#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:35:32,842 INFO L290 TraceCheckUtils]: 93: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:32,843 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19349#true} {19402#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:32,843 INFO L290 TraceCheckUtils]: 91: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,843 INFO L290 TraceCheckUtils]: 90: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,843 INFO L290 TraceCheckUtils]: 89: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,843 INFO L272 TraceCheckUtils]: 88: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,844 INFO L290 TraceCheckUtils]: 87: Hoare triple {19402#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:32,844 INFO L290 TraceCheckUtils]: 86: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19402#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:35:32,844 INFO L290 TraceCheckUtils]: 85: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:32,845 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {19349#true} {19397#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:32,845 INFO L290 TraceCheckUtils]: 83: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,845 INFO L290 TraceCheckUtils]: 82: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,845 INFO L290 TraceCheckUtils]: 81: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,845 INFO L272 TraceCheckUtils]: 80: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {19397#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:32,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19397#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:35:32,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:32,846 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {19349#true} {19392#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:32,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,847 INFO L290 TraceCheckUtils]: 74: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,847 INFO L272 TraceCheckUtils]: 72: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,847 INFO L290 TraceCheckUtils]: 71: Hoare triple {19392#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:32,847 INFO L290 TraceCheckUtils]: 70: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19392#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:35:32,848 INFO L290 TraceCheckUtils]: 69: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:32,848 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19349#true} {19387#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:32,848 INFO L290 TraceCheckUtils]: 67: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,848 INFO L290 TraceCheckUtils]: 66: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,848 INFO L290 TraceCheckUtils]: 65: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,848 INFO L272 TraceCheckUtils]: 64: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,849 INFO L290 TraceCheckUtils]: 63: Hoare triple {19387#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:32,849 INFO L290 TraceCheckUtils]: 62: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19387#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:35:32,849 INFO L290 TraceCheckUtils]: 61: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:32,850 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19349#true} {19382#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:32,850 INFO L290 TraceCheckUtils]: 59: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,850 INFO L272 TraceCheckUtils]: 56: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {19382#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:32,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19382#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:35:32,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:32,852 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {19349#true} {19377#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:32,852 INFO L290 TraceCheckUtils]: 51: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,852 INFO L272 TraceCheckUtils]: 48: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {19377#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:32,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19377#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:35:32,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:32,853 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19349#true} {19372#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:32,853 INFO L290 TraceCheckUtils]: 43: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,856 INFO L272 TraceCheckUtils]: 40: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {19372#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:32,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {19372#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:35:32,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:35:32,857 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19349#true} {20064#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:35:32,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {19349#true} assume !(0 == ~cond); {19349#true} is VALID [2022-04-15 12:35:32,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {19349#true} ~cond := #in~cond; {19349#true} is VALID [2022-04-15 12:35:32,857 INFO L272 TraceCheckUtils]: 32: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {19349#true} is VALID [2022-04-15 12:35:32,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {20064#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:35:32,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {19366#(<= main_~n~0 11)} ~i~1 := 0; {20064#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:35:32,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {19365#(<= main_~i~0 11)} assume !(~i~0 < ~n~0); {19366#(<= main_~n~0 11)} is VALID [2022-04-15 12:35:32,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {19364#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19365#(<= main_~i~0 11)} is VALID [2022-04-15 12:35:32,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {19364#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19364#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:32,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {19363#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19364#(<= main_~i~0 10)} is VALID [2022-04-15 12:35:32,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {19363#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19363#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:32,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {19362#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19363#(<= main_~i~0 9)} is VALID [2022-04-15 12:35:32,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {19362#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19362#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:32,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {19361#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19362#(<= main_~i~0 8)} is VALID [2022-04-15 12:35:32,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {19361#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19361#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:32,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {19360#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19361#(<= main_~i~0 7)} is VALID [2022-04-15 12:35:32,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {19360#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19360#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:32,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {19359#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19360#(<= main_~i~0 6)} is VALID [2022-04-15 12:35:32,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {19359#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19359#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:32,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {19358#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19359#(<= main_~i~0 5)} is VALID [2022-04-15 12:35:32,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {19358#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19358#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:32,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {19357#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19358#(<= main_~i~0 4)} is VALID [2022-04-15 12:35:32,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {19357#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19357#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:32,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {19356#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19357#(<= main_~i~0 3)} is VALID [2022-04-15 12:35:32,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {19356#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19356#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:32,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {19355#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19356#(<= main_~i~0 2)} is VALID [2022-04-15 12:35:32,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {19355#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19355#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:32,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {19445#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {19355#(<= main_~i~0 1)} is VALID [2022-04-15 12:35:32,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {19445#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {19445#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:32,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {19349#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {19445#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:32,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {19349#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {19349#true} is VALID [2022-04-15 12:35:32,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {19349#true} call #t~ret6 := main(); {19349#true} is VALID [2022-04-15 12:35:32,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19349#true} {19349#true} #70#return; {19349#true} is VALID [2022-04-15 12:35:32,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {19349#true} assume true; {19349#true} is VALID [2022-04-15 12:35:32,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {19349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19349#true} is VALID [2022-04-15 12:35:32,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {19349#true} call ULTIMATE.init(); {19349#true} is VALID [2022-04-15 12:35:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 264 proven. 121 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 12:35:32,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886991806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:35:32,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:35:32,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 42 [2022-04-15 12:35:32,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:32,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [651723240] [2022-04-15 12:35:32,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [651723240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:32,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:32,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:35:32,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027748718] [2022-04-15 12:35:32,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:32,869 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 124 [2022-04-15 12:35:32,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:32,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:32,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:32,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:35:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:32,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:35:32,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1338, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:35:32,910 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:33,964 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2022-04-15 12:35:33,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:35:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 124 [2022-04-15 12:35:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-15 12:35:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-15 12:35:33,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 113 transitions. [2022-04-15 12:35:34,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:34,051 INFO L225 Difference]: With dead ends: 186 [2022-04-15 12:35:34,051 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 12:35:34,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=790, Invalid=3632, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:35:34,052 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:34,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:35:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 12:35:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-04-15 12:35:34,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:34,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:35:34,141 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:35:34,141 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:35:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:34,143 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-15 12:35:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 12:35:34,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:34,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:34,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-15 12:35:34,144 INFO L87 Difference]: Start difference. First operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 130 states. [2022-04-15 12:35:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:34,145 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2022-04-15 12:35:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2022-04-15 12:35:34,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:34,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:34,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:34,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 102 states have internal predecessors, (103), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:35:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-04-15 12:35:34,148 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2022-04-15 12:35:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:34,148 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-04-15 12:35:34,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 27 states have internal predecessors, (68), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:35:34,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 130 transitions. [2022-04-15 12:35:34,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-15 12:35:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 12:35:34,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:34,336 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:34,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:35:34,536 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:34,537 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 43 times [2022-04-15 12:35:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:34,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802610231] [2022-04-15 12:35:34,539 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:35:34,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:35:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1844578604, now seen corresponding path program 44 times [2022-04-15 12:35:34,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:34,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444800968] [2022-04-15 12:35:34,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:34,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:35:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {21199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21121#true} is VALID [2022-04-15 12:35:35,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-15 12:35:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 12:35:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:35:35,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 12:35:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 12:35:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:35,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 12:35:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 12:35:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:35,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 12:35:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:35,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 12:35:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-15 12:35:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-15 12:35:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:35,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-15 12:35:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:35,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-15 12:35:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:35,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:35:35,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {21199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21121#true} is VALID [2022-04-15 12:35:35,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-15 12:35:35,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-15 12:35:35,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-15 12:35:35,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-15 12:35:35,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-15 12:35:35,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:35:35,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:35:35,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:35:35,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:35:35,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:35:35,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:35:35,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:35:35,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:35:35,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:35:35,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:35:35,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:35:35,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:35:35,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:35:35,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:35:35,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:35:35,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:35:35,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:35:35,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:35:35,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:35:35,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:35:35,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:35:35,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21138#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:35:35,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {21138#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 12:35:35,067 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 12:35:35,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:35:35,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:35:35,067 INFO L272 TraceCheckUtils]: 34: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,068 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21121#true} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:35:35,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:35:35,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,069 INFO L290 TraceCheckUtils]: 41: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,069 INFO L272 TraceCheckUtils]: 42: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,070 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,070 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,070 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,070 INFO L290 TraceCheckUtils]: 47: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:35,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:35,072 INFO L272 TraceCheckUtils]: 50: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,072 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,072 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:35,073 INFO L290 TraceCheckUtils]: 55: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:35:35,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,074 INFO L272 TraceCheckUtils]: 58: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,074 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,074 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,074 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,075 INFO L290 TraceCheckUtils]: 63: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:35,076 INFO L290 TraceCheckUtils]: 65: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:35,076 INFO L272 TraceCheckUtils]: 66: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,076 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,076 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,076 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,076 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:35,077 INFO L290 TraceCheckUtils]: 71: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:35:35,077 INFO L290 TraceCheckUtils]: 72: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:35,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:35,078 INFO L272 TraceCheckUtils]: 74: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,078 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,078 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:35,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:35:35,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:35,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:35,080 INFO L272 TraceCheckUtils]: 82: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,080 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,080 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:35,081 INFO L290 TraceCheckUtils]: 87: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:35:35,081 INFO L290 TraceCheckUtils]: 88: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,081 INFO L290 TraceCheckUtils]: 89: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,081 INFO L272 TraceCheckUtils]: 90: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,082 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,082 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,082 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,082 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,082 INFO L290 TraceCheckUtils]: 95: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,083 INFO L290 TraceCheckUtils]: 96: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:35,083 INFO L290 TraceCheckUtils]: 97: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:35,083 INFO L272 TraceCheckUtils]: 98: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,083 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,083 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,084 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,084 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:35,084 INFO L290 TraceCheckUtils]: 103: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:35:35,085 INFO L290 TraceCheckUtils]: 104: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:35,085 INFO L290 TraceCheckUtils]: 105: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:35,085 INFO L272 TraceCheckUtils]: 106: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,085 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,085 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,085 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,086 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:35,086 INFO L290 TraceCheckUtils]: 111: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:35:35,087 INFO L290 TraceCheckUtils]: 112: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:35,087 INFO L290 TraceCheckUtils]: 113: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:35,087 INFO L272 TraceCheckUtils]: 114: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:35:35,087 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:35:35,087 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:35:35,087 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:35:35,088 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:35,088 INFO L290 TraceCheckUtils]: 119: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:35:35,089 INFO L290 TraceCheckUtils]: 120: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:35:35,089 INFO L290 TraceCheckUtils]: 121: Hoare triple {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:35:35,089 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21197#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:35:35,090 INFO L290 TraceCheckUtils]: 123: Hoare triple {21197#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {21198#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:35:35,090 INFO L290 TraceCheckUtils]: 124: Hoare triple {21198#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21122#false} is VALID [2022-04-15 12:35:35,090 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-15 12:35:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 12:35:35,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:35,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444800968] [2022-04-15 12:35:35,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444800968] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:35,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055100896] [2022-04-15 12:35:35,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:35:35,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:35,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:35,095 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:35:35,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:35:35,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:35:35,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:35,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 12:35:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:35,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:35,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:39:16,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 12:39:16,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-15 12:39:16,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21121#true} is VALID [2022-04-15 12:39:16,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:16,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-15 12:39:16,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-15 12:39:16,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-15 12:39:16,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-15 12:39:16,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-15 12:39:16,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:39:16,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:39:16,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:39:16,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:39:16,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:39:16,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:39:16,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:39:16,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:39:16,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:39:16,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:39:16,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:39:16,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:39:16,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:39:16,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:39:16,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:39:16,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:39:16,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:39:16,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:39:16,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:39:16,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:39:16,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:39:16,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 12:39:16,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 12:39:16,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 12:39:16,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,288 INFO L272 TraceCheckUtils]: 34: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,289 INFO L290 TraceCheckUtils]: 37: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,290 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {21140#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,292 INFO L272 TraceCheckUtils]: 42: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,292 INFO L290 TraceCheckUtils]: 44: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,292 INFO L290 TraceCheckUtils]: 45: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,293 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,293 INFO L290 TraceCheckUtils]: 47: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {21324#(and (= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,295 INFO L272 TraceCheckUtils]: 50: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,295 INFO L290 TraceCheckUtils]: 51: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,296 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,297 INFO L290 TraceCheckUtils]: 55: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {21349#(and (= main_~i~1 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,298 INFO L272 TraceCheckUtils]: 58: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,299 INFO L290 TraceCheckUtils]: 60: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,299 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,300 INFO L290 TraceCheckUtils]: 64: Hoare triple {21374#(and (= 2 (+ (- 1) main_~i~1)) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,301 INFO L290 TraceCheckUtils]: 65: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,301 INFO L272 TraceCheckUtils]: 66: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,302 INFO L290 TraceCheckUtils]: 69: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,303 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,303 INFO L290 TraceCheckUtils]: 71: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,303 INFO L290 TraceCheckUtils]: 72: Hoare triple {21399#(and (= (+ (- 2) main_~i~1) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,305 INFO L272 TraceCheckUtils]: 74: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,305 INFO L290 TraceCheckUtils]: 75: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,305 INFO L290 TraceCheckUtils]: 76: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,305 INFO L290 TraceCheckUtils]: 77: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,306 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,306 INFO L290 TraceCheckUtils]: 79: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,307 INFO L290 TraceCheckUtils]: 80: Hoare triple {21424#(and (= (+ main_~i~1 (- 3)) 2) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,307 INFO L290 TraceCheckUtils]: 81: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,308 INFO L272 TraceCheckUtils]: 82: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,308 INFO L290 TraceCheckUtils]: 83: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,308 INFO L290 TraceCheckUtils]: 84: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,309 INFO L290 TraceCheckUtils]: 85: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,309 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,310 INFO L290 TraceCheckUtils]: 87: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,310 INFO L290 TraceCheckUtils]: 88: Hoare triple {21449#(and (= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,310 INFO L290 TraceCheckUtils]: 89: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,311 INFO L272 TraceCheckUtils]: 90: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,311 INFO L290 TraceCheckUtils]: 91: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,312 INFO L290 TraceCheckUtils]: 92: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,312 INFO L290 TraceCheckUtils]: 93: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,312 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,313 INFO L290 TraceCheckUtils]: 95: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,313 INFO L290 TraceCheckUtils]: 96: Hoare triple {21474#(and (= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,314 INFO L290 TraceCheckUtils]: 97: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,314 INFO L272 TraceCheckUtils]: 98: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,315 INFO L290 TraceCheckUtils]: 99: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,315 INFO L290 TraceCheckUtils]: 100: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,315 INFO L290 TraceCheckUtils]: 101: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,316 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,316 INFO L290 TraceCheckUtils]: 103: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,316 INFO L290 TraceCheckUtils]: 104: Hoare triple {21499#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-15 12:39:16,317 INFO L290 TraceCheckUtils]: 105: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-15 12:39:16,318 INFO L272 TraceCheckUtils]: 106: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,318 INFO L290 TraceCheckUtils]: 107: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,318 INFO L290 TraceCheckUtils]: 108: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,318 INFO L290 TraceCheckUtils]: 109: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,319 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} #68#return; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-15 12:39:16,319 INFO L290 TraceCheckUtils]: 111: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} havoc #t~mem5; {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} is VALID [2022-04-15 12:39:16,320 INFO L290 TraceCheckUtils]: 112: Hoare triple {21524#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0) (= main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,320 INFO L290 TraceCheckUtils]: 113: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,321 INFO L272 TraceCheckUtils]: 114: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,321 INFO L290 TraceCheckUtils]: 115: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} ~cond := #in~cond; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,321 INFO L290 TraceCheckUtils]: 116: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume !(0 == ~cond); {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,322 INFO L290 TraceCheckUtils]: 117: Hoare triple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} assume true; {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} is VALID [2022-04-15 12:39:16,322 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21305#(exists ((v_main_~x~0.base_BEFORE_CALL_64 Int) (v_main_~x~0.offset_BEFORE_CALL_64 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_64) (+ 44 v_main_~x~0.offset_BEFORE_CALL_64)) 0))} {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #68#return; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,323 INFO L290 TraceCheckUtils]: 119: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} havoc #t~mem5; {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,323 INFO L290 TraceCheckUtils]: 120: Hoare triple {21549#(and (= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21574#(and (= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} is VALID [2022-04-15 12:39:16,323 INFO L290 TraceCheckUtils]: 121: Hoare triple {21574#(and (= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:39:16,324 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:39:16,324 INFO L290 TraceCheckUtils]: 123: Hoare triple {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:39:16,324 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-15 12:39:16,325 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-15 12:39:16,325 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 12:39:16,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:39:18,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-04-15 12:39:18,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-15 12:39:18,869 INFO L290 TraceCheckUtils]: 125: Hoare triple {21122#false} assume !false; {21122#false} is VALID [2022-04-15 12:39:18,869 INFO L290 TraceCheckUtils]: 124: Hoare triple {21585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21122#false} is VALID [2022-04-15 12:39:18,869 INFO L290 TraceCheckUtils]: 123: Hoare triple {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:39:18,870 INFO L272 TraceCheckUtils]: 122: Hoare triple {21196#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:39:18,870 INFO L290 TraceCheckUtils]: 121: Hoare triple {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21196#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:39:18,871 INFO L290 TraceCheckUtils]: 120: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21195#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,871 INFO L290 TraceCheckUtils]: 119: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:39:18,872 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {21121#true} {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:39:18,872 INFO L290 TraceCheckUtils]: 117: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,872 INFO L290 TraceCheckUtils]: 116: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,872 INFO L290 TraceCheckUtils]: 115: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,872 INFO L272 TraceCheckUtils]: 114: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,872 INFO L290 TraceCheckUtils]: 113: Hoare triple {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:39:18,873 INFO L290 TraceCheckUtils]: 112: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21190#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:39:18,873 INFO L290 TraceCheckUtils]: 111: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:39:18,874 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {21121#true} {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:39:18,874 INFO L290 TraceCheckUtils]: 109: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,874 INFO L290 TraceCheckUtils]: 108: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,874 INFO L290 TraceCheckUtils]: 107: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,874 INFO L272 TraceCheckUtils]: 106: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,874 INFO L290 TraceCheckUtils]: 105: Hoare triple {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:39:18,875 INFO L290 TraceCheckUtils]: 104: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21185#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:39:18,875 INFO L290 TraceCheckUtils]: 103: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:39:18,876 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {21121#true} {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:39:18,876 INFO L290 TraceCheckUtils]: 101: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,876 INFO L290 TraceCheckUtils]: 100: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,876 INFO L290 TraceCheckUtils]: 99: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,876 INFO L272 TraceCheckUtils]: 98: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,877 INFO L290 TraceCheckUtils]: 97: Hoare triple {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:39:18,877 INFO L290 TraceCheckUtils]: 96: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21180#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:39:18,877 INFO L290 TraceCheckUtils]: 95: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,878 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21121#true} {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,878 INFO L290 TraceCheckUtils]: 91: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,878 INFO L272 TraceCheckUtils]: 90: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,879 INFO L290 TraceCheckUtils]: 89: Hoare triple {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21175#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,879 INFO L290 TraceCheckUtils]: 87: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:39:18,880 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21121#true} {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:39:18,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,880 INFO L272 TraceCheckUtils]: 82: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,881 INFO L290 TraceCheckUtils]: 81: Hoare triple {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:39:18,881 INFO L290 TraceCheckUtils]: 80: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21170#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:39:18,881 INFO L290 TraceCheckUtils]: 79: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:39:18,882 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {21121#true} {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:39:18,882 INFO L290 TraceCheckUtils]: 77: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,882 INFO L290 TraceCheckUtils]: 76: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,882 INFO L290 TraceCheckUtils]: 75: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,882 INFO L272 TraceCheckUtils]: 74: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,883 INFO L290 TraceCheckUtils]: 73: Hoare triple {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:39:18,883 INFO L290 TraceCheckUtils]: 72: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21165#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:39:18,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:39:18,884 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {21121#true} {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:39:18,884 INFO L290 TraceCheckUtils]: 69: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,884 INFO L290 TraceCheckUtils]: 68: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,884 INFO L272 TraceCheckUtils]: 66: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,885 INFO L290 TraceCheckUtils]: 65: Hoare triple {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:39:18,885 INFO L290 TraceCheckUtils]: 64: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21160#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:39:18,885 INFO L290 TraceCheckUtils]: 63: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,886 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {21121#true} {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,886 INFO L290 TraceCheckUtils]: 61: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,886 INFO L290 TraceCheckUtils]: 59: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,886 INFO L272 TraceCheckUtils]: 58: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,887 INFO L290 TraceCheckUtils]: 56: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21155#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,888 INFO L290 TraceCheckUtils]: 55: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:39:18,888 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21121#true} {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:39:18,888 INFO L290 TraceCheckUtils]: 53: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,888 INFO L290 TraceCheckUtils]: 52: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,888 INFO L290 TraceCheckUtils]: 51: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,888 INFO L272 TraceCheckUtils]: 50: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,889 INFO L290 TraceCheckUtils]: 49: Hoare triple {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:39:18,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21150#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:39:18,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,890 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21121#true} {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,890 INFO L272 TraceCheckUtils]: 42: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {21145#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,892 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21121#true} {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,892 INFO L290 TraceCheckUtils]: 37: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {21121#true} assume !(0 == ~cond); {21121#true} is VALID [2022-04-15 12:39:18,892 INFO L290 TraceCheckUtils]: 35: Hoare triple {21121#true} ~cond := #in~cond; {21121#true} is VALID [2022-04-15 12:39:18,892 INFO L272 TraceCheckUtils]: 34: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {21121#true} is VALID [2022-04-15 12:39:18,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} ~i~1 := 0; {21847#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:39:18,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} assume !(~i~0 < ~n~0); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 12:39:18,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 12:39:18,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21139#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44)) 0)} is VALID [2022-04-15 12:39:18,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21137#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:39:18,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:39:18,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21136#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:39:18,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:39:18,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21135#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:39:18,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:39:18,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21134#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:39:18,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:39:18,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21133#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:39:18,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:39:18,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21132#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:39:18,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:39:18,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21131#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:39:18,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:39:18,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21130#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:39:18,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:39:18,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21129#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:39:18,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:39:18,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21128#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:39:18,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:39:18,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {21126#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21127#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:39:18,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {21126#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {21126#(= main_~i~0 0)} is VALID [2022-04-15 12:39:18,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {21121#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {21126#(= main_~i~0 0)} is VALID [2022-04-15 12:39:18,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {21121#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {21121#true} is VALID [2022-04-15 12:39:18,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {21121#true} call #t~ret6 := main(); {21121#true} is VALID [2022-04-15 12:39:18,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21121#true} {21121#true} #70#return; {21121#true} is VALID [2022-04-15 12:39:18,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {21121#true} assume true; {21121#true} is VALID [2022-04-15 12:39:18,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {21121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {21121#true} is VALID [2022-04-15 12:39:18,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {21121#true} call ULTIMATE.init(); {21121#true} is VALID [2022-04-15 12:39:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 22 proven. 386 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 12:39:18,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055100896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:39:18,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:39:18,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 30] total 47 [2022-04-15 12:39:18,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:18,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802610231] [2022-04-15 12:39:18,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802610231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:18,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:18,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:39:18,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814141585] [2022-04-15 12:39:18,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 126 [2022-04-15 12:39:18,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:18,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:39:18,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:18,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:39:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:39:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2017, Unknown=12, NotChecked=0, Total=2162 [2022-04-15 12:39:18,970 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:39:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:23,879 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-04-15 12:39:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:39:23,880 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 126 [2022-04-15 12:39:23,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:39:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-15 12:39:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:39:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-15 12:39:23,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 110 transitions. [2022-04-15 12:39:23,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:23,974 INFO L225 Difference]: With dead ends: 142 [2022-04-15 12:39:23,974 INFO L226 Difference]: Without dead ends: 140 [2022-04-15 12:39:23,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 235 SyntacticMatches, 26 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 222.4s TimeCoverageRelationStatistics Valid=304, Invalid=5536, Unknown=12, NotChecked=0, Total=5852 [2022-04-15 12:39:23,974 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 85 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:23,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 172 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 12:39:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-15 12:39:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2022-04-15 12:39:24,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:24,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:24,056 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:24,057 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:24,058 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-15 12:39:24,058 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-15 12:39:24,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:24,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:24,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-15 12:39:24,059 INFO L87 Difference]: Start difference. First operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-15 12:39:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:24,060 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-15 12:39:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-15 12:39:24,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:24,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:24,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:24,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 108 states have internal predecessors, (109), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2022-04-15 12:39:24,062 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 126 [2022-04-15 12:39:24,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:24,062 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2022-04-15 12:39:24,063 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 30 states have internal predecessors, (70), 13 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 12:39:24,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 138 transitions. [2022-04-15 12:39:24,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 12:39:24,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 12:39:24,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:24,268 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:24,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:39:24,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:39:24,468 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:24,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 45 times [2022-04-15 12:39:24,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:24,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1732421093] [2022-04-15 12:39:24,471 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:39:24,471 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:39:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 886065326, now seen corresponding path program 46 times [2022-04-15 12:39:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:24,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68224298] [2022-04-15 12:39:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,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-15 12:39:24,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-15 12:39:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 12:39:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #68#return; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 12:39:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 12:39:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 12:39:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 12:39:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:24,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 12:39:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 12:39:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 12:39:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:24,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-15 12:39:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-15 12:39:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:24,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-15 12:39:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-15 12:39:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-15 12:39:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:24,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:24,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {22948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22868#true} is VALID [2022-04-15 12:39:24,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-15 12:39:24,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-15 12:39:24,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-15 12:39:24,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22873#(= main_~i~0 0)} is VALID [2022-04-15 12:39:24,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {22873#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22873#(= main_~i~0 0)} is VALID [2022-04-15 12:39:24,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {22873#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-15 12:39:24,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-15 12:39:24,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-15 12:39:24,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-15 12:39:24,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-15 12:39:24,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-15 12:39:24,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-15 12:39:24,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-15 12:39:24,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-15 12:39:24,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-15 12:39:24,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-15 12:39:24,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-15 12:39:24,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-15 12:39:24,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-15 12:39:24,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-15 12:39:24,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-15 12:39:24,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-15 12:39:24,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-15 12:39:24,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-15 12:39:24,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-15 12:39:24,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-15 12:39:24,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-15 12:39:24,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-15 12:39:24,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-15 12:39:24,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 12:39:24,819 INFO L290 TraceCheckUtils]: 33: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 12:39:24,819 INFO L272 TraceCheckUtils]: 34: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,819 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,819 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,820 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #68#return; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 12:39:24,820 INFO L290 TraceCheckUtils]: 39: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} havoc #t~mem5; {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} is VALID [2022-04-15 12:39:24,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {22887#(and (<= main_~n~0 12) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:24,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:24,821 INFO L272 TraceCheckUtils]: 42: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,822 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:24,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:24,822 INFO L290 TraceCheckUtils]: 48: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:24,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:24,823 INFO L272 TraceCheckUtils]: 50: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,823 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:24,824 INFO L290 TraceCheckUtils]: 55: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:24,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:24,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:24,824 INFO L272 TraceCheckUtils]: 58: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,825 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,825 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:24,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:24,826 INFO L290 TraceCheckUtils]: 64: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:24,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:24,826 INFO L272 TraceCheckUtils]: 66: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,826 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,826 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,827 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:24,827 INFO L290 TraceCheckUtils]: 71: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:24,828 INFO L290 TraceCheckUtils]: 72: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:24,828 INFO L290 TraceCheckUtils]: 73: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:24,828 INFO L272 TraceCheckUtils]: 74: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,828 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,828 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,829 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:24,829 INFO L290 TraceCheckUtils]: 79: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:24,829 INFO L290 TraceCheckUtils]: 80: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:24,830 INFO L290 TraceCheckUtils]: 81: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:24,830 INFO L272 TraceCheckUtils]: 82: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,830 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,830 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,830 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:24,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:24,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:24,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:24,831 INFO L272 TraceCheckUtils]: 90: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,831 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,831 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,831 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,832 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:24,832 INFO L290 TraceCheckUtils]: 95: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:24,832 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:24,833 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:24,833 INFO L272 TraceCheckUtils]: 98: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,833 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,833 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,833 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,833 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:24,834 INFO L290 TraceCheckUtils]: 103: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:24,834 INFO L290 TraceCheckUtils]: 104: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:24,834 INFO L290 TraceCheckUtils]: 105: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:24,834 INFO L272 TraceCheckUtils]: 106: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,835 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,835 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,835 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,835 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:24,835 INFO L290 TraceCheckUtils]: 111: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:24,836 INFO L290 TraceCheckUtils]: 112: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:24,836 INFO L290 TraceCheckUtils]: 113: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:24,836 INFO L272 TraceCheckUtils]: 114: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,836 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,836 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,836 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,837 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:24,837 INFO L290 TraceCheckUtils]: 119: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:24,837 INFO L290 TraceCheckUtils]: 120: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:24,838 INFO L290 TraceCheckUtils]: 121: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:24,838 INFO L272 TraceCheckUtils]: 122: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:24,838 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:24,838 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:24,838 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:24,838 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:24,839 INFO L290 TraceCheckUtils]: 127: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:24,839 INFO L290 TraceCheckUtils]: 128: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22947#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:39:24,839 INFO L290 TraceCheckUtils]: 129: Hoare triple {22947#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-15 12:39:24,839 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-15 12:39:24,839 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-15 12:39:24,839 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-15 12:39:24,839 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-15 12:39:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 267 proven. 189 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 12:39:24,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:24,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68224298] [2022-04-15 12:39:24,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68224298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:39:24,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608791437] [2022-04-15 12:39:24,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:39:24,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:39:24,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:39:24,845 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:39:24,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:39:25,251 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:39:25,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:39:25,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:39:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:25,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:39:26,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-15 12:39:26,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22868#true} is VALID [2022-04-15 12:39:26,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-15 12:39:26,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-15 12:39:26,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-15 12:39:26,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22970#(<= main_~i~0 0)} is VALID [2022-04-15 12:39:26,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {22970#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22970#(<= main_~i~0 0)} is VALID [2022-04-15 12:39:26,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {22970#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-15 12:39:26,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-15 12:39:26,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-15 12:39:26,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-15 12:39:26,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-15 12:39:26,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-15 12:39:26,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-15 12:39:26,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-15 12:39:26,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-15 12:39:26,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-15 12:39:26,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-15 12:39:26,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-15 12:39:26,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-15 12:39:26,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-15 12:39:26,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-15 12:39:26,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-15 12:39:26,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-15 12:39:26,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-15 12:39:26,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-15 12:39:26,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-15 12:39:26,275 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-15 12:39:26,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-15 12:39:26,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-15 12:39:26,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-15 12:39:26,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,277 INFO L272 TraceCheckUtils]: 34: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,277 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} #68#return; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {23049#(and (<= 0 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,279 INFO L272 TraceCheckUtils]: 42: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,279 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,279 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} #68#return; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,280 INFO L290 TraceCheckUtils]: 48: Hoare triple {23074#(and (<= 1 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,280 INFO L290 TraceCheckUtils]: 49: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,280 INFO L272 TraceCheckUtils]: 50: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,280 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,281 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} #68#return; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,281 INFO L290 TraceCheckUtils]: 55: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {23099#(and (<= 2 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-15 12:39:26,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-15 12:39:26,282 INFO L272 TraceCheckUtils]: 58: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,283 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} #68#return; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-15 12:39:26,283 INFO L290 TraceCheckUtils]: 63: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} havoc #t~mem5; {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} is VALID [2022-04-15 12:39:26,284 INFO L290 TraceCheckUtils]: 64: Hoare triple {23124#(and (<= main_~n~0 12) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,284 INFO L290 TraceCheckUtils]: 65: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,284 INFO L272 TraceCheckUtils]: 66: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,284 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,284 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,285 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} #68#return; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,285 INFO L290 TraceCheckUtils]: 71: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,285 INFO L290 TraceCheckUtils]: 72: Hoare triple {23149#(and (<= 4 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,286 INFO L290 TraceCheckUtils]: 73: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,286 INFO L272 TraceCheckUtils]: 74: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,286 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,286 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,286 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,286 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} #68#return; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,287 INFO L290 TraceCheckUtils]: 79: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,287 INFO L290 TraceCheckUtils]: 80: Hoare triple {23174#(and (<= 5 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,288 INFO L290 TraceCheckUtils]: 81: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,288 INFO L272 TraceCheckUtils]: 82: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,288 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,288 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,288 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,288 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} #68#return; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,289 INFO L290 TraceCheckUtils]: 88: Hoare triple {23199#(and (<= 6 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,289 INFO L290 TraceCheckUtils]: 89: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,290 INFO L272 TraceCheckUtils]: 90: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,290 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,290 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} #68#return; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,290 INFO L290 TraceCheckUtils]: 95: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,291 INFO L290 TraceCheckUtils]: 96: Hoare triple {23224#(and (<= 7 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,291 INFO L290 TraceCheckUtils]: 97: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,291 INFO L272 TraceCheckUtils]: 98: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,291 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,292 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,292 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,292 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} #68#return; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,292 INFO L290 TraceCheckUtils]: 103: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,293 INFO L290 TraceCheckUtils]: 104: Hoare triple {23249#(and (<= 8 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,293 INFO L290 TraceCheckUtils]: 105: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,293 INFO L272 TraceCheckUtils]: 106: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,293 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,293 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,293 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,294 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} #68#return; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,294 INFO L290 TraceCheckUtils]: 111: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,295 INFO L290 TraceCheckUtils]: 112: Hoare triple {23274#(and (<= 9 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,295 INFO L290 TraceCheckUtils]: 113: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,295 INFO L272 TraceCheckUtils]: 114: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,295 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,295 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,295 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,296 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} #68#return; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,296 INFO L290 TraceCheckUtils]: 119: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,296 INFO L290 TraceCheckUtils]: 120: Hoare triple {23299#(and (<= 10 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,297 INFO L290 TraceCheckUtils]: 121: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,297 INFO L272 TraceCheckUtils]: 122: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,297 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,297 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,297 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,297 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} #68#return; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,298 INFO L290 TraceCheckUtils]: 127: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} havoc #t~mem5; {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} is VALID [2022-04-15 12:39:26,298 INFO L290 TraceCheckUtils]: 128: Hoare triple {23324#(and (<= 11 main_~i~1) (<= main_~n~0 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {23349#(and (<= main_~n~0 12) (<= 12 main_~i~1))} is VALID [2022-04-15 12:39:26,299 INFO L290 TraceCheckUtils]: 129: Hoare triple {23349#(and (<= main_~n~0 12) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-15 12:39:26,299 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-15 12:39:26,299 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-15 12:39:26,299 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-15 12:39:26,299 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-15 12:39:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 312 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 12:39:26,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:39:26,777 INFO L290 TraceCheckUtils]: 133: Hoare triple {22869#false} assume !false; {22869#false} is VALID [2022-04-15 12:39:26,777 INFO L290 TraceCheckUtils]: 132: Hoare triple {22869#false} assume 0 == ~cond; {22869#false} is VALID [2022-04-15 12:39:26,777 INFO L290 TraceCheckUtils]: 131: Hoare triple {22869#false} ~cond := #in~cond; {22869#false} is VALID [2022-04-15 12:39:26,777 INFO L272 TraceCheckUtils]: 130: Hoare triple {22869#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22869#false} is VALID [2022-04-15 12:39:26,777 INFO L290 TraceCheckUtils]: 129: Hoare triple {22947#(<= main_~n~0 main_~i~1)} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22869#false} is VALID [2022-04-15 12:39:26,778 INFO L290 TraceCheckUtils]: 128: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22947#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:39:26,778 INFO L290 TraceCheckUtils]: 127: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:26,779 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22868#true} {22942#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:26,779 INFO L290 TraceCheckUtils]: 125: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,779 INFO L290 TraceCheckUtils]: 124: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,779 INFO L290 TraceCheckUtils]: 123: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,779 INFO L272 TraceCheckUtils]: 122: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,779 INFO L290 TraceCheckUtils]: 121: Hoare triple {22942#(<= main_~n~0 (+ main_~i~1 1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:26,780 INFO L290 TraceCheckUtils]: 120: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22942#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:39:26,780 INFO L290 TraceCheckUtils]: 119: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:26,780 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {22868#true} {22937#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:26,780 INFO L290 TraceCheckUtils]: 117: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,780 INFO L290 TraceCheckUtils]: 116: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,781 INFO L290 TraceCheckUtils]: 115: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,781 INFO L272 TraceCheckUtils]: 114: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,781 INFO L290 TraceCheckUtils]: 113: Hoare triple {22937#(<= main_~n~0 (+ main_~i~1 2))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:26,781 INFO L290 TraceCheckUtils]: 112: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22937#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:39:26,782 INFO L290 TraceCheckUtils]: 111: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:26,782 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {22868#true} {22932#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:26,782 INFO L290 TraceCheckUtils]: 109: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,782 INFO L290 TraceCheckUtils]: 108: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,782 INFO L290 TraceCheckUtils]: 107: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,782 INFO L272 TraceCheckUtils]: 106: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,783 INFO L290 TraceCheckUtils]: 105: Hoare triple {22932#(<= main_~n~0 (+ main_~i~1 3))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:26,783 INFO L290 TraceCheckUtils]: 104: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22932#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:39:26,783 INFO L290 TraceCheckUtils]: 103: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:26,784 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {22868#true} {22927#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:26,784 INFO L290 TraceCheckUtils]: 101: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,784 INFO L290 TraceCheckUtils]: 99: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,784 INFO L272 TraceCheckUtils]: 98: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,784 INFO L290 TraceCheckUtils]: 97: Hoare triple {22927#(<= main_~n~0 (+ main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:26,785 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22927#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:39:26,785 INFO L290 TraceCheckUtils]: 95: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:26,786 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22868#true} {22922#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:26,786 INFO L290 TraceCheckUtils]: 93: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,786 INFO L290 TraceCheckUtils]: 92: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,786 INFO L290 TraceCheckUtils]: 91: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,786 INFO L272 TraceCheckUtils]: 90: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,786 INFO L290 TraceCheckUtils]: 89: Hoare triple {22922#(<= main_~n~0 (+ 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:26,787 INFO L290 TraceCheckUtils]: 88: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22922#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:39:26,787 INFO L290 TraceCheckUtils]: 87: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:26,787 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {22868#true} {22917#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:26,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,788 INFO L290 TraceCheckUtils]: 83: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,788 INFO L272 TraceCheckUtils]: 82: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,788 INFO L290 TraceCheckUtils]: 81: Hoare triple {22917#(<= main_~n~0 (+ main_~i~1 6))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:26,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22917#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:39:26,789 INFO L290 TraceCheckUtils]: 79: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:26,789 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {22868#true} {22912#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:26,789 INFO L290 TraceCheckUtils]: 77: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,789 INFO L290 TraceCheckUtils]: 76: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,790 INFO L290 TraceCheckUtils]: 75: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,790 INFO L272 TraceCheckUtils]: 74: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,790 INFO L290 TraceCheckUtils]: 73: Hoare triple {22912#(<= main_~n~0 (+ 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:26,790 INFO L290 TraceCheckUtils]: 72: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22912#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:39:26,791 INFO L290 TraceCheckUtils]: 71: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:26,791 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {22868#true} {22907#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:26,791 INFO L290 TraceCheckUtils]: 69: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,791 INFO L290 TraceCheckUtils]: 68: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,791 INFO L290 TraceCheckUtils]: 67: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,791 INFO L272 TraceCheckUtils]: 66: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {22907#(<= main_~n~0 (+ main_~i~1 8))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:26,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22907#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:39:26,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:26,793 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {22868#true} {22902#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:26,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,793 INFO L290 TraceCheckUtils]: 60: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,793 INFO L290 TraceCheckUtils]: 59: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,793 INFO L272 TraceCheckUtils]: 58: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {22902#(<= main_~n~0 (+ main_~i~1 9))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:26,794 INFO L290 TraceCheckUtils]: 56: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22902#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:39:26,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:26,795 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22868#true} {22897#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:26,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,795 INFO L272 TraceCheckUtils]: 50: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,796 INFO L290 TraceCheckUtils]: 49: Hoare triple {22897#(<= main_~n~0 (+ main_~i~1 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:26,796 INFO L290 TraceCheckUtils]: 48: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22897#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:39:26,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:26,797 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22868#true} {22892#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:26,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,797 INFO L290 TraceCheckUtils]: 44: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,797 INFO L290 TraceCheckUtils]: 43: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,797 INFO L272 TraceCheckUtils]: 42: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {22892#(<= main_~n~0 (+ main_~i~1 11))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:26,798 INFO L290 TraceCheckUtils]: 40: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {22892#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:39:26,798 INFO L290 TraceCheckUtils]: 39: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:39:26,799 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22868#true} {23644#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:39:26,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {22868#true} assume !(0 == ~cond); {22868#true} is VALID [2022-04-15 12:39:26,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {22868#true} ~cond := #in~cond; {22868#true} is VALID [2022-04-15 12:39:26,799 INFO L272 TraceCheckUtils]: 34: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {22868#true} is VALID [2022-04-15 12:39:26,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {23644#(<= main_~n~0 (+ main_~i~1 12))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:39:26,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {22886#(<= main_~n~0 12)} ~i~1 := 0; {23644#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:39:26,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {22885#(<= main_~i~0 12)} assume !(~i~0 < ~n~0); {22886#(<= main_~n~0 12)} is VALID [2022-04-15 12:39:26,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {22884#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22885#(<= main_~i~0 12)} is VALID [2022-04-15 12:39:26,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {22884#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22884#(<= main_~i~0 11)} is VALID [2022-04-15 12:39:26,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {22883#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22884#(<= main_~i~0 11)} is VALID [2022-04-15 12:39:26,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {22883#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22883#(<= main_~i~0 10)} is VALID [2022-04-15 12:39:26,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {22882#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22883#(<= main_~i~0 10)} is VALID [2022-04-15 12:39:26,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {22882#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22882#(<= main_~i~0 9)} is VALID [2022-04-15 12:39:26,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {22881#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22882#(<= main_~i~0 9)} is VALID [2022-04-15 12:39:26,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {22881#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22881#(<= main_~i~0 8)} is VALID [2022-04-15 12:39:26,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {22880#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22881#(<= main_~i~0 8)} is VALID [2022-04-15 12:39:26,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {22880#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22880#(<= main_~i~0 7)} is VALID [2022-04-15 12:39:26,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {22879#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22880#(<= main_~i~0 7)} is VALID [2022-04-15 12:39:26,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {22879#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22879#(<= main_~i~0 6)} is VALID [2022-04-15 12:39:26,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {22878#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22879#(<= main_~i~0 6)} is VALID [2022-04-15 12:39:26,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {22878#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22878#(<= main_~i~0 5)} is VALID [2022-04-15 12:39:26,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {22877#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22878#(<= main_~i~0 5)} is VALID [2022-04-15 12:39:26,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {22877#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22877#(<= main_~i~0 4)} is VALID [2022-04-15 12:39:26,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {22876#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22877#(<= main_~i~0 4)} is VALID [2022-04-15 12:39:26,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {22876#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22876#(<= main_~i~0 3)} is VALID [2022-04-15 12:39:26,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {22875#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22876#(<= main_~i~0 3)} is VALID [2022-04-15 12:39:26,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {22875#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22875#(<= main_~i~0 2)} is VALID [2022-04-15 12:39:26,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {22874#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22875#(<= main_~i~0 2)} is VALID [2022-04-15 12:39:26,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {22874#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22874#(<= main_~i~0 1)} is VALID [2022-04-15 12:39:26,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {22970#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {22874#(<= main_~i~0 1)} is VALID [2022-04-15 12:39:26,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {22970#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {22970#(<= main_~i~0 0)} is VALID [2022-04-15 12:39:26,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {22868#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {22970#(<= main_~i~0 0)} is VALID [2022-04-15 12:39:26,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {22868#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {22868#true} is VALID [2022-04-15 12:39:26,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {22868#true} call #t~ret6 := main(); {22868#true} is VALID [2022-04-15 12:39:26,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22868#true} {22868#true} #70#return; {22868#true} is VALID [2022-04-15 12:39:26,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {22868#true} assume true; {22868#true} is VALID [2022-04-15 12:39:26,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {22868#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {22868#true} is VALID [2022-04-15 12:39:26,809 INFO L272 TraceCheckUtils]: 0: Hoare triple {22868#true} call ULTIMATE.init(); {22868#true} is VALID [2022-04-15 12:39:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 312 proven. 144 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 12:39:26,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608791437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:39:26,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:39:26,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 45 [2022-04-15 12:39:26,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:26,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1732421093] [2022-04-15 12:39:26,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1732421093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:26,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:26,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:39:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185298958] [2022-04-15 12:39:26,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 134 [2022-04-15 12:39:26,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:26,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:26,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:26,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:39:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:39:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:39:26,878 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:28,229 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2022-04-15 12:39:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:39:28,230 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 134 [2022-04-15 12:39:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-15 12:39:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 120 transitions. [2022-04-15 12:39:28,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 120 transitions. [2022-04-15 12:39:28,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:28,324 INFO L225 Difference]: With dead ends: 200 [2022-04-15 12:39:28,324 INFO L226 Difference]: Without dead ends: 140 [2022-04-15 12:39:28,325 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=906, Invalid=4206, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 12:39:28,325 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:28,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 74 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:39:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-15 12:39:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2022-04-15 12:39:28,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:28,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:28,427 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:28,427 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:28,429 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-15 12:39:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-15 12:39:28,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:28,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:28,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-15 12:39:28,430 INFO L87 Difference]: Start difference. First operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 140 states. [2022-04-15 12:39:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:28,431 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-04-15 12:39:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-04-15 12:39:28,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:28,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:28,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:28,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 109 states have (on average 1.018348623853211) internal successors, (111), 110 states have internal predecessors, (111), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-04-15 12:39:28,433 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2022-04-15 12:39:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:28,433 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-04-15 12:39:28,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 29 states have internal predecessors, (73), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:28,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 140 transitions. [2022-04-15 12:39:28,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-04-15 12:39:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 12:39:28,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:28,659 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:28,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:39:28,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 12:39:28,860 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 47 times [2022-04-15 12:39:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:28,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782367362] [2022-04-15 12:39:28,863 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:39:28,863 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:39:28,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1055030388, now seen corresponding path program 48 times [2022-04-15 12:39:28,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:28,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226683858] [2022-04-15 12:39:28,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {24863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24779#true} is VALID [2022-04-15 12:39:29,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-15 12:39:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 12:39:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 12:39:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 12:39:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 12:39:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 12:39:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #68#return; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 12:39:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 12:39:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-15 12:39:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-15 12:39:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 12:39:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-15 12:39:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-15 12:39:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-15 12:39:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:29,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {24779#true} call ULTIMATE.init(); {24863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:29,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {24863#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24779#true} is VALID [2022-04-15 12:39:29,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-15 12:39:29,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-15 12:39:29,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {24779#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24779#true} is VALID [2022-04-15 12:39:29,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {24779#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:29,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} is VALID [2022-04-15 12:39:29,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {24784#(and (= main_~x~0.offset 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:39:29,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:39:29,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {24785#(and (= main_~x~0.offset 0) (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:39:29,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:39:29,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {24786#(and (= main_~x~0.offset 0) (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:39:29,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:39:29,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {24787#(and (= main_~x~0.offset 0) (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:39:29,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:39:29,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {24788#(and (= main_~x~0.offset 0) (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:39:29,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:39:29,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {24789#(and (= main_~x~0.offset 0) (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:39:29,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:39:29,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {24790#(and (= main_~x~0.offset 0) (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} is VALID [2022-04-15 12:39:29,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} is VALID [2022-04-15 12:39:29,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {24791#(and (<= main_~i~0 7) (= main_~x~0.offset 0) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:39:29,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:39:29,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {24792#(and (= main_~x~0.offset 0) (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:39:29,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:39:29,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {24793#(and (= main_~x~0.offset 0) (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:39:29,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:39:29,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {24794#(and (= main_~x~0.offset 0) (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:39:29,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:39:29,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {24795#(and (= main_~x~0.offset 0) (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24796#(and (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} is VALID [2022-04-15 12:39:29,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {24796#(and (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24797#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} is VALID [2022-04-15 12:39:29,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {24797#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (= main_~x~0.offset 0) (not (<= (+ main_~x~0.offset (* main_~i~0 4)) 47)) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !(~i~0 < ~n~0); {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {24798#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} ~i~1 := 0; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,651 INFO L272 TraceCheckUtils]: 36: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,652 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24779#true} {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {24799#(and (= main_~x~0.offset 0) (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,653 INFO L272 TraceCheckUtils]: 44: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,653 INFO L290 TraceCheckUtils]: 45: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,654 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24779#true} {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {24804#(and (<= 1 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,655 INFO L272 TraceCheckUtils]: 52: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,656 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {24779#true} {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,657 INFO L290 TraceCheckUtils]: 58: Hoare triple {24809#(and (= main_~x~0.offset 0) (<= main_~i~1 2) (<= 2 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,657 INFO L290 TraceCheckUtils]: 59: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,657 INFO L272 TraceCheckUtils]: 60: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,658 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24779#true} {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,658 INFO L290 TraceCheckUtils]: 65: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {24814#(and (= main_~x~0.offset 0) (<= main_~i~1 3) (<= 3 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 12:39:29,659 INFO L290 TraceCheckUtils]: 67: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 12:39:29,659 INFO L272 TraceCheckUtils]: 68: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,659 INFO L290 TraceCheckUtils]: 69: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,659 INFO L290 TraceCheckUtils]: 70: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,659 INFO L290 TraceCheckUtils]: 71: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,660 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24779#true} {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #68#return; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 12:39:29,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} havoc #t~mem5; {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} is VALID [2022-04-15 12:39:29,661 INFO L290 TraceCheckUtils]: 74: Hoare triple {24819#(and (= main_~x~0.offset 0) (<= 4 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0) (<= main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,661 INFO L290 TraceCheckUtils]: 75: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,661 INFO L272 TraceCheckUtils]: 76: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,661 INFO L290 TraceCheckUtils]: 77: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,661 INFO L290 TraceCheckUtils]: 78: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,661 INFO L290 TraceCheckUtils]: 79: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,662 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24779#true} {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,662 INFO L290 TraceCheckUtils]: 81: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,662 INFO L290 TraceCheckUtils]: 82: Hoare triple {24824#(and (<= main_~i~1 5) (= main_~x~0.offset 0) (<= 5 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,663 INFO L290 TraceCheckUtils]: 83: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,663 INFO L272 TraceCheckUtils]: 84: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,663 INFO L290 TraceCheckUtils]: 85: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,663 INFO L290 TraceCheckUtils]: 86: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,663 INFO L290 TraceCheckUtils]: 87: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,664 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {24779#true} {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,664 INFO L290 TraceCheckUtils]: 89: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,664 INFO L290 TraceCheckUtils]: 90: Hoare triple {24829#(and (<= 6 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 6) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,665 INFO L290 TraceCheckUtils]: 91: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,665 INFO L272 TraceCheckUtils]: 92: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,665 INFO L290 TraceCheckUtils]: 93: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,665 INFO L290 TraceCheckUtils]: 94: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,665 INFO L290 TraceCheckUtils]: 95: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,666 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {24779#true} {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,666 INFO L290 TraceCheckUtils]: 97: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,666 INFO L290 TraceCheckUtils]: 98: Hoare triple {24834#(and (= main_~x~0.offset 0) (<= main_~i~1 7) (<= 7 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,667 INFO L290 TraceCheckUtils]: 99: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,667 INFO L272 TraceCheckUtils]: 100: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,667 INFO L290 TraceCheckUtils]: 101: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,667 INFO L290 TraceCheckUtils]: 102: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,667 INFO L290 TraceCheckUtils]: 103: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,667 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {24779#true} {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,668 INFO L290 TraceCheckUtils]: 105: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,668 INFO L290 TraceCheckUtils]: 106: Hoare triple {24839#(and (= main_~x~0.offset 0) (<= main_~i~1 8) (<= 8 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,669 INFO L290 TraceCheckUtils]: 107: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,669 INFO L272 TraceCheckUtils]: 108: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,669 INFO L290 TraceCheckUtils]: 109: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,669 INFO L290 TraceCheckUtils]: 110: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,669 INFO L290 TraceCheckUtils]: 111: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,669 INFO L284 TraceCheckUtils]: 112: Hoare quadruple {24779#true} {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,670 INFO L290 TraceCheckUtils]: 113: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,670 INFO L290 TraceCheckUtils]: 114: Hoare triple {24844#(and (= main_~x~0.offset 0) (<= main_~i~1 9) (<= 9 main_~i~1) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,671 INFO L290 TraceCheckUtils]: 115: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,671 INFO L272 TraceCheckUtils]: 116: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,671 INFO L290 TraceCheckUtils]: 117: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,671 INFO L290 TraceCheckUtils]: 118: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,671 INFO L290 TraceCheckUtils]: 119: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,671 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {24779#true} {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,672 INFO L290 TraceCheckUtils]: 121: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,672 INFO L290 TraceCheckUtils]: 122: Hoare triple {24849#(and (<= 10 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 10) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,672 INFO L290 TraceCheckUtils]: 123: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,673 INFO L272 TraceCheckUtils]: 124: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24779#true} is VALID [2022-04-15 12:39:29,673 INFO L290 TraceCheckUtils]: 125: Hoare triple {24779#true} ~cond := #in~cond; {24779#true} is VALID [2022-04-15 12:39:29,673 INFO L290 TraceCheckUtils]: 126: Hoare triple {24779#true} assume !(0 == ~cond); {24779#true} is VALID [2022-04-15 12:39:29,673 INFO L290 TraceCheckUtils]: 127: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:29,673 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {24779#true} {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #68#return; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,673 INFO L290 TraceCheckUtils]: 129: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} havoc #t~mem5; {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} is VALID [2022-04-15 12:39:29,674 INFO L290 TraceCheckUtils]: 130: Hoare triple {24854#(and (<= 11 main_~i~1) (= main_~x~0.offset 0) (<= main_~i~1 11) (= (select (select |#memory_int| main_~x~0.base) 48) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {24859#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= 48 (+ main_~x~0.offset (* main_~i~1 4))))} is VALID [2022-04-15 12:39:29,674 INFO L290 TraceCheckUtils]: 131: Hoare triple {24859#(and (= main_~x~0.offset 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0) (= 48 (+ main_~x~0.offset (* main_~i~1 4))))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24860#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:39:29,675 INFO L272 TraceCheckUtils]: 132: Hoare triple {24860#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24861#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:39:29,675 INFO L290 TraceCheckUtils]: 133: Hoare triple {24861#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {24862#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:39:29,675 INFO L290 TraceCheckUtils]: 134: Hoare triple {24862#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24780#false} is VALID [2022-04-15 12:39:29,675 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-15 12:39:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 24 proven. 457 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 12:39:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:29,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226683858] [2022-04-15 12:39:29,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226683858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:39:29,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247145889] [2022-04-15 12:39:29,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:39:29,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:39:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:39:29,677 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:39:29,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:39:29,984 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-04-15 12:39:29,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:39:29,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:39:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:30,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:39:30,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:39:41,623 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:39:41,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:39:41,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {24779#true} call ULTIMATE.init(); {24779#true} is VALID [2022-04-15 12:39:41,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {24779#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24779#true} is VALID [2022-04-15 12:39:41,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {24779#true} assume true; {24779#true} is VALID [2022-04-15 12:39:41,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24779#true} {24779#true} #70#return; {24779#true} is VALID [2022-04-15 12:39:41,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {24779#true} call #t~ret6 := main(); {24779#true} is VALID [2022-04-15 12:39:41,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {24779#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24779#true} is VALID [2022-04-15 12:39:41,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {24779#true} assume !!(0 <= ~n~0 && ~n~0 <= 1000);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~n~0);~x~0.base, ~x~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {24885#(<= main_~i~0 0)} is VALID [2022-04-15 12:39:41,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {24885#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24885#(<= main_~i~0 0)} is VALID [2022-04-15 12:39:41,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {24885#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24892#(<= main_~i~0 1)} is VALID [2022-04-15 12:39:41,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {24892#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24892#(<= main_~i~0 1)} is VALID [2022-04-15 12:39:41,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {24892#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24899#(<= main_~i~0 2)} is VALID [2022-04-15 12:39:41,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {24899#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24899#(<= main_~i~0 2)} is VALID [2022-04-15 12:39:41,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {24899#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24906#(<= main_~i~0 3)} is VALID [2022-04-15 12:39:41,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {24906#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24906#(<= main_~i~0 3)} is VALID [2022-04-15 12:39:41,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {24906#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24913#(<= main_~i~0 4)} is VALID [2022-04-15 12:39:41,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {24913#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24913#(<= main_~i~0 4)} is VALID [2022-04-15 12:39:41,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {24913#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24920#(<= main_~i~0 5)} is VALID [2022-04-15 12:39:41,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {24920#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24920#(<= main_~i~0 5)} is VALID [2022-04-15 12:39:41,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {24920#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24927#(<= main_~i~0 6)} is VALID [2022-04-15 12:39:41,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {24927#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24927#(<= main_~i~0 6)} is VALID [2022-04-15 12:39:41,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {24927#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24934#(<= main_~i~0 7)} is VALID [2022-04-15 12:39:41,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {24934#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24934#(<= main_~i~0 7)} is VALID [2022-04-15 12:39:41,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {24934#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24941#(<= main_~i~0 8)} is VALID [2022-04-15 12:39:41,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {24941#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24941#(<= main_~i~0 8)} is VALID [2022-04-15 12:39:41,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {24941#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24948#(<= main_~i~0 9)} is VALID [2022-04-15 12:39:41,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {24948#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24948#(<= main_~i~0 9)} is VALID [2022-04-15 12:39:41,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {24948#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24955#(<= main_~i~0 10)} is VALID [2022-04-15 12:39:41,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {24955#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24955#(<= main_~i~0 10)} is VALID [2022-04-15 12:39:41,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {24955#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24962#(<= main_~i~0 11)} is VALID [2022-04-15 12:39:41,701 INFO L290 TraceCheckUtils]: 29: Hoare triple {24962#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24962#(<= main_~i~0 11)} is VALID [2022-04-15 12:39:41,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {24962#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24969#(<= main_~i~0 12)} is VALID [2022-04-15 12:39:41,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {24969#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {24973#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 12))} is VALID [2022-04-15 12:39:41,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {24973#(and (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24977#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~i~0 (+ v_main_~i~0_336 1))))} is VALID [2022-04-15 12:39:41,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {24977#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~i~0 (+ v_main_~i~0_336 1))))} assume !(~i~0 < ~n~0); {24981#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1))))} is VALID [2022-04-15 12:39:41,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {24981#(exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1))))} ~i~1 := 0; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:39:41,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:39:41,706 INFO L272 TraceCheckUtils]: 36: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,706 INFO L290 TraceCheckUtils]: 38: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,707 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} #68#return; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:39:41,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} havoc #t~mem5; {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} is VALID [2022-04-15 12:39:41,708 INFO L290 TraceCheckUtils]: 42: Hoare triple {24985#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-15 12:39:41,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-15 12:39:41,715 INFO L272 TraceCheckUtils]: 44: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,716 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} #68#return; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-15 12:39:41,716 INFO L290 TraceCheckUtils]: 49: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} havoc #t~mem5; {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} is VALID [2022-04-15 12:39:41,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {25011#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:39:41,717 INFO L290 TraceCheckUtils]: 51: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:39:41,723 INFO L272 TraceCheckUtils]: 52: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,724 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} #68#return; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:39:41,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} havoc #t~mem5; {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} is VALID [2022-04-15 12:39:41,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {25036#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:39:41,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:39:41,728 INFO L272 TraceCheckUtils]: 60: Hoare triple {25061#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,729 INFO L290 TraceCheckUtils]: 62: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,729 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; {25080#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:39:41,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {25080#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25080#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 3 main_~i~1))} is VALID [2022-04-15 12:39:41,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {25080#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:39:41,730 INFO L290 TraceCheckUtils]: 67: Hoare triple {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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); {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:39:41,733 INFO L272 TraceCheckUtils]: 68: Hoare triple {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,733 INFO L290 TraceCheckUtils]: 71: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,734 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)))} {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:39:41,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 4 main_~i~1))} is VALID [2022-04-15 12:39:41,735 INFO L290 TraceCheckUtils]: 74: Hoare triple {25087#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:39:41,735 INFO L290 TraceCheckUtils]: 75: Hoare triple {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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); {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:39:41,738 INFO L272 TraceCheckUtils]: 76: Hoare triple {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,739 INFO L290 TraceCheckUtils]: 77: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,739 INFO L290 TraceCheckUtils]: 78: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,739 INFO L290 TraceCheckUtils]: 79: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,739 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)))} {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:39:41,740 INFO L290 TraceCheckUtils]: 81: Hoare triple {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 5 main_~i~1))} is VALID [2022-04-15 12:39:41,740 INFO L290 TraceCheckUtils]: 82: Hoare triple {25112#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-15 12:39:41,741 INFO L290 TraceCheckUtils]: 83: Hoare triple {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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); {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-15 12:39:41,746 INFO L272 TraceCheckUtils]: 84: Hoare triple {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,746 INFO L290 TraceCheckUtils]: 85: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,746 INFO L290 TraceCheckUtils]: 86: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,746 INFO L290 TraceCheckUtils]: 87: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,747 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)))} {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-15 12:39:41,747 INFO L290 TraceCheckUtils]: 89: Hoare triple {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 6 main_~i~1))} is VALID [2022-04-15 12:39:41,748 INFO L290 TraceCheckUtils]: 90: Hoare triple {25137#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 12:39:41,748 INFO L290 TraceCheckUtils]: 91: Hoare triple {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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); {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 12:39:41,750 INFO L272 TraceCheckUtils]: 92: Hoare triple {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,751 INFO L290 TraceCheckUtils]: 93: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,751 INFO L290 TraceCheckUtils]: 94: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,751 INFO L290 TraceCheckUtils]: 95: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,751 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)))} {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 12:39:41,752 INFO L290 TraceCheckUtils]: 97: Hoare triple {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 7 main_~i~1))} is VALID [2022-04-15 12:39:41,752 INFO L290 TraceCheckUtils]: 98: Hoare triple {25162#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 12:39:41,753 INFO L290 TraceCheckUtils]: 99: Hoare triple {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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); {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 12:39:41,758 INFO L272 TraceCheckUtils]: 100: Hoare triple {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,758 INFO L290 TraceCheckUtils]: 101: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,759 INFO L290 TraceCheckUtils]: 102: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,759 INFO L290 TraceCheckUtils]: 103: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,759 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)))} {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 12:39:41,760 INFO L290 TraceCheckUtils]: 105: Hoare triple {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 8 main_~i~1))} is VALID [2022-04-15 12:39:41,760 INFO L290 TraceCheckUtils]: 106: Hoare triple {25187#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 12:39:41,761 INFO L290 TraceCheckUtils]: 107: Hoare triple {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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); {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 12:39:41,765 INFO L272 TraceCheckUtils]: 108: Hoare triple {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,765 INFO L290 TraceCheckUtils]: 109: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,765 INFO L290 TraceCheckUtils]: 111: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,766 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)))} {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 12:39:41,766 INFO L290 TraceCheckUtils]: 113: Hoare triple {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 9 main_~i~1))} is VALID [2022-04-15 12:39:41,767 INFO L290 TraceCheckUtils]: 114: Hoare triple {25212#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-15 12:39:41,767 INFO L290 TraceCheckUtils]: 115: Hoare triple {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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); {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-15 12:39:41,771 INFO L272 TraceCheckUtils]: 116: Hoare triple {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,771 INFO L290 TraceCheckUtils]: 117: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,772 INFO L290 TraceCheckUtils]: 118: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,772 INFO L290 TraceCheckUtils]: 119: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,772 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)))} {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-15 12:39:41,773 INFO L290 TraceCheckUtils]: 121: Hoare triple {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 10 main_~i~1))} is VALID [2022-04-15 12:39:41,773 INFO L290 TraceCheckUtils]: 122: Hoare triple {25237#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-15 12:39:41,774 INFO L290 TraceCheckUtils]: 123: Hoare triple {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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); {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-15 12:39:41,781 INFO L272 TraceCheckUtils]: 124: Hoare triple {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,781 INFO L290 TraceCheckUtils]: 125: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} ~cond := #in~cond; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,781 INFO L290 TraceCheckUtils]: 126: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume !(0 == ~cond); {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,782 INFO L290 TraceCheckUtils]: 127: Hoare triple {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} assume true; {24992#(exists ((v_main_~x~0.base_BEFORE_CALL_86 Int) (v_main_~x~0.offset_BEFORE_CALL_86 Int) (v_main_~i~0_336 Int)) (and (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_86) (+ (* 4 v_main_~i~0_336) v_main_~x~0.offset_BEFORE_CALL_86)) 0) (<= v_main_~i~0_336 12)))} is VALID [2022-04-15 12:39:41,782 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)))} {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-15 12:39:41,782 INFO L290 TraceCheckUtils]: 129: Hoare triple {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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; {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* 4 v_main_~i~0_336)))) (<= main_~n~0 (+ v_main_~i~0_336 1)))) (<= 11 main_~i~1))} is VALID [2022-04-15 12:39:41,783 INFO L290 TraceCheckUtils]: 130: Hoare triple {25262#(and (exists ((v_main_~i~0_336 Int)) (and (<= v_main_~i~0_336 12) (= 0 (select (select |#memory_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-15 12:39:41,783 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-15 12:39:41,784 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-15 12:39:41,784 INFO L290 TraceCheckUtils]: 133: Hoare triple {25294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:39:41,784 INFO L290 TraceCheckUtils]: 134: Hoare triple {25298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24780#false} is VALID [2022-04-15 12:39:41,784 INFO L290 TraceCheckUtils]: 135: Hoare triple {24780#false} assume !false; {24780#false} is VALID [2022-04-15 12:39:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 276 proven. 205 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 12:39:41,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:39:41,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247145889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:39:41,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:39:41,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 67 [2022-04-15 12:39:41,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:41,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782367362] [2022-04-15 12:39:41,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782367362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:41,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:41,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:39:41,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437263614] [2022-04-15 12:39:41,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:41,994 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 136 [2022-04-15 12:39:41,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:41,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:42,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:42,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:39:42,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:42,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:39:42,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=4224, Unknown=1, NotChecked=0, Total=4692 [2022-04-15 12:39:42,083 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:47,410 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2022-04-15 12:39:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:39:47,410 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 136 [2022-04-15 12:39:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-15 12:39:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 117 transitions. [2022-04-15 12:39:47,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 117 transitions. [2022-04-15 12:39:47,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:47,515 INFO L225 Difference]: With dead ends: 152 [2022-04-15 12:39:47,515 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 12:39:47,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 112 SyntacticMatches, 23 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3335 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=744, Invalid=9355, Unknown=1, NotChecked=0, Total=10100 [2022-04-15 12:39:47,516 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:47,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 183 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3192 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 12:39:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 12:39:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-04-15 12:39:47,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:47,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:39:47,639 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:39:47,640 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:39:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:47,641 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-15 12:39:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-15 12:39:47,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:47,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:47,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-15 12:39:47,642 INFO L87 Difference]: Start difference. First operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-15 12:39:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:47,644 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-15 12:39:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-15 12:39:47,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:47,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:47,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:47,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.017391304347826) internal successors, (117), 116 states have internal predecessors, (117), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:39:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-04-15 12:39:47,661 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 136 [2022-04-15 12:39:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:47,661 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-04-15 12:39:47,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.272727272727273) internal successors, (75), 32 states have internal predecessors, (75), 14 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 12:39:47,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 148 transitions. [2022-04-15 12:39:47,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-04-15 12:39:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 12:39:47,859 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:47,859 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:47,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:39:48,059 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 12:39:48,059 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:48,060 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 49 times [2022-04-15 12:39:48,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:48,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [181528472] [2022-04-15 12:39:48,062 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:39:48,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:39:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash -490496666, now seen corresponding path program 50 times [2022-04-15 12:39:48,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:48,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738223528] [2022-04-15 12:39:48,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:48,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,414 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-15 12:39:48,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26292#true} {26292#true} #70#return; {26292#true} is VALID [2022-04-15 12:39:48,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-15 12:39:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,416 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-15 12:39:48,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-04-15 12:39:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,419 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-15 12:39:48,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-15 12:39:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,421 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-15 12:39:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-15 12:39:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,424 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-15 12:39:48,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-04-15 12:39:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,426 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-15 12:39:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-15 12:39:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,428 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-15 12:39:48,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-04-15 12:39:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,431 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-15 12:39:48,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-04-15 12:39:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,433 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-15 12:39:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-04-15 12:39:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,436 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-15 12:39:48,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-04-15 12:39:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,439 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-15 12:39:48,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-04-15 12:39:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,441 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-15 12:39:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-04-15 12:39:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,444 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-15 12:39:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-04-15 12:39:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,446 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-15 12:39:48,447 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-15 12:39:48,447 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-15 12:39:48,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26292#true} #70#return; {26292#true} is VALID [2022-04-15 12:39:48,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {26292#true} call #t~ret6 := main(); {26292#true} is VALID [2022-04-15 12:39:48,447 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-15 12:39:48,447 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-15 12:39:48,447 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-15 12:39:48,448 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-15 12:39:48,448 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-15 12:39:48,449 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-15 12:39:48,449 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-15 12:39:48,449 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-15 12:39:48,450 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-15 12:39:48,450 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-15 12:39:48,450 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-15 12:39:48,451 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-15 12:39:48,451 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-15 12:39:48,451 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-15 12:39:48,452 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-15 12:39:48,452 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-15 12:39:48,452 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-15 12:39:48,453 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-15 12:39:48,453 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-15 12:39:48,453 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-15 12:39:48,454 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-15 12:39:48,454 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-15 12:39:48,454 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-15 12:39:48,455 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-15 12:39:48,455 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-15 12:39:48,455 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-15 12:39:48,456 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-15 12:39:48,456 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-15 12:39:48,457 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-15 12:39:48,457 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-15 12:39:48,457 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-15 12:39:48,457 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-15 12:39:48,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,458 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-15 12:39:48,458 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-15 12:39:48,459 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-15 12:39:48,459 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-15 12:39:48,459 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-15 12:39:48,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,459 INFO L290 TraceCheckUtils]: 47: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,460 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-15 12:39:48,460 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-15 12:39:48,460 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-15 12:39:48,461 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-15 12:39:48,461 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-15 12:39:48,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,461 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-15 12:39:48,462 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-15 12:39:48,462 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-15 12:39:48,462 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-15 12:39:48,463 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-15 12:39:48,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,463 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-15 12:39:48,464 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-15 12:39:48,464 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-15 12:39:48,464 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-15 12:39:48,464 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-15 12:39:48,464 INFO L290 TraceCheckUtils]: 69: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,465 INFO L290 TraceCheckUtils]: 70: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,465 INFO L290 TraceCheckUtils]: 71: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,465 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-15 12:39:48,465 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-15 12:39:48,466 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-15 12:39:48,466 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-15 12:39:48,466 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-15 12:39:48,466 INFO L290 TraceCheckUtils]: 77: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,466 INFO L290 TraceCheckUtils]: 78: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,466 INFO L290 TraceCheckUtils]: 79: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,467 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-15 12:39:48,467 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-15 12:39:48,467 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-15 12:39:48,467 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-15 12:39:48,468 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-15 12:39:48,468 INFO L290 TraceCheckUtils]: 85: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,468 INFO L290 TraceCheckUtils]: 86: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,468 INFO L290 TraceCheckUtils]: 87: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,468 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-15 12:39:48,468 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-15 12:39:48,469 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-15 12:39:48,469 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-15 12:39:48,469 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-15 12:39:48,469 INFO L290 TraceCheckUtils]: 93: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,469 INFO L290 TraceCheckUtils]: 94: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,469 INFO L290 TraceCheckUtils]: 95: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,470 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-15 12:39:48,470 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-15 12:39:48,470 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-15 12:39:48,471 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-15 12:39:48,471 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-15 12:39:48,471 INFO L290 TraceCheckUtils]: 101: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,471 INFO L290 TraceCheckUtils]: 102: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,471 INFO L290 TraceCheckUtils]: 103: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,471 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-15 12:39:48,472 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-15 12:39:48,472 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-15 12:39:48,472 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-15 12:39:48,472 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-15 12:39:48,472 INFO L290 TraceCheckUtils]: 109: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,473 INFO L290 TraceCheckUtils]: 110: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,473 INFO L290 TraceCheckUtils]: 111: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,473 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-15 12:39:48,473 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-15 12:39:48,474 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-15 12:39:48,474 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-15 12:39:48,474 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-15 12:39:48,474 INFO L290 TraceCheckUtils]: 117: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,474 INFO L290 TraceCheckUtils]: 118: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,474 INFO L290 TraceCheckUtils]: 119: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,475 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-15 12:39:48,475 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-15 12:39:48,475 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-15 12:39:48,476 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-15 12:39:48,476 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-15 12:39:48,476 INFO L290 TraceCheckUtils]: 125: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,476 INFO L290 TraceCheckUtils]: 126: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,476 INFO L290 TraceCheckUtils]: 127: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,476 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-15 12:39:48,477 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-15 12:39:48,477 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-15 12:39:48,477 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-15 12:39:48,477 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-15 12:39:48,477 INFO L290 TraceCheckUtils]: 133: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:48,477 INFO L290 TraceCheckUtils]: 134: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:48,477 INFO L290 TraceCheckUtils]: 135: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:48,478 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-15 12:39:48,478 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-15 12:39:48,478 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-15 12:39:48,479 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-15 12:39:48,479 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-15 12:39:48,479 INFO L290 TraceCheckUtils]: 141: Hoare triple {26293#false} ~cond := #in~cond; {26293#false} is VALID [2022-04-15 12:39:48,479 INFO L290 TraceCheckUtils]: 142: Hoare triple {26293#false} assume 0 == ~cond; {26293#false} is VALID [2022-04-15 12:39:48,479 INFO L290 TraceCheckUtils]: 143: Hoare triple {26293#false} assume !false; {26293#false} is VALID [2022-04-15 12:39:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 315 proven. 218 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 12:39:48,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738223528] [2022-04-15 12:39:48,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738223528] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:39:48,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207183898] [2022-04-15 12:39:48,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:39:48,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:39:48,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:39:48,496 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:39:48,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:39:48,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:39:48,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:39:48,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:39:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:48,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:39:49,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {26292#true} call ULTIMATE.init(); {26292#true} is VALID [2022-04-15 12:39:49,748 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-15 12:39:49,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26292#true} #70#return; {26292#true} is VALID [2022-04-15 12:39:49,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {26292#true} call #t~ret6 := main(); {26292#true} is VALID [2022-04-15 12:39:49,748 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-15 12:39:49,748 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-15 12:39:49,749 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-15 12:39:49,749 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-15 12:39:49,749 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-15 12:39:49,750 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-15 12:39:49,750 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-15 12:39:49,750 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-15 12:39:49,751 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-15 12:39:49,751 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-15 12:39:49,751 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-15 12:39:49,752 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-15 12:39:49,752 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-15 12:39:49,752 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-15 12:39:49,753 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-15 12:39:49,753 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-15 12:39:49,753 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-15 12:39:49,754 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-15 12:39:49,754 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-15 12:39:49,754 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-15 12:39:49,755 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-15 12:39:49,755 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-15 12:39:49,755 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-15 12:39:49,756 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-15 12:39:49,756 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-15 12:39:49,756 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-15 12:39:49,757 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-15 12:39:49,757 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-15 12:39:49,757 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-15 12:39:49,758 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-15 12:39:49,758 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-15 12:39:49,758 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-15 12:39:49,758 INFO L290 TraceCheckUtils]: 37: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,759 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-15 12:39:49,759 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-15 12:39:49,760 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-15 12:39:49,760 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-15 12:39:49,760 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-15 12:39:49,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,760 INFO L290 TraceCheckUtils]: 46: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,760 INFO L290 TraceCheckUtils]: 47: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,761 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-15 12:39:49,761 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-15 12:39:49,762 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-15 12:39:49,762 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-15 12:39:49,762 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-15 12:39:49,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,762 INFO L290 TraceCheckUtils]: 54: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,762 INFO L290 TraceCheckUtils]: 55: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,763 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-15 12:39:49,763 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-15 12:39:49,763 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-15 12:39:49,764 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-15 12:39:49,764 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-15 12:39:49,764 INFO L290 TraceCheckUtils]: 61: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,764 INFO L290 TraceCheckUtils]: 63: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,764 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-15 12:39:49,765 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-15 12:39:49,765 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-15 12:39:49,766 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-15 12:39:49,766 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-15 12:39:49,766 INFO L290 TraceCheckUtils]: 69: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,766 INFO L290 TraceCheckUtils]: 70: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,766 INFO L290 TraceCheckUtils]: 71: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,766 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-15 12:39:49,767 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-15 12:39:49,767 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-15 12:39:49,767 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-15 12:39:49,768 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-15 12:39:49,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,768 INFO L290 TraceCheckUtils]: 79: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,768 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-15 12:39:49,768 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-15 12:39:49,769 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-15 12:39:49,769 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-15 12:39:49,769 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-15 12:39:49,769 INFO L290 TraceCheckUtils]: 85: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,770 INFO L290 TraceCheckUtils]: 86: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,770 INFO L290 TraceCheckUtils]: 87: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,770 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-15 12:39:49,770 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-15 12:39:49,771 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-15 12:39:49,771 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-15 12:39:49,771 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-15 12:39:49,771 INFO L290 TraceCheckUtils]: 93: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,771 INFO L290 TraceCheckUtils]: 94: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,771 INFO L290 TraceCheckUtils]: 95: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,772 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-15 12:39:49,772 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-15 12:39:49,773 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-15 12:39:49,773 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-15 12:39:49,773 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-15 12:39:49,773 INFO L290 TraceCheckUtils]: 101: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,773 INFO L290 TraceCheckUtils]: 102: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,773 INFO L290 TraceCheckUtils]: 103: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,774 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-15 12:39:49,774 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-15 12:39:49,774 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-15 12:39:49,775 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-15 12:39:49,775 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-15 12:39:49,775 INFO L290 TraceCheckUtils]: 109: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,775 INFO L290 TraceCheckUtils]: 110: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,775 INFO L290 TraceCheckUtils]: 111: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,775 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-15 12:39:49,776 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-15 12:39:49,776 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-15 12:39:49,777 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-15 12:39:49,777 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-15 12:39:49,777 INFO L290 TraceCheckUtils]: 117: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,777 INFO L290 TraceCheckUtils]: 118: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,777 INFO L290 TraceCheckUtils]: 119: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,777 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-15 12:39:49,778 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-15 12:39:49,778 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-15 12:39:49,778 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-15 12:39:49,778 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-15 12:39:49,779 INFO L290 TraceCheckUtils]: 125: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,779 INFO L290 TraceCheckUtils]: 126: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,779 INFO L290 TraceCheckUtils]: 127: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,779 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-15 12:39:49,779 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-15 12:39:49,780 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-15 12:39:49,780 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-15 12:39:49,780 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-15 12:39:49,780 INFO L290 TraceCheckUtils]: 133: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:49,780 INFO L290 TraceCheckUtils]: 134: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:49,781 INFO L290 TraceCheckUtils]: 135: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:49,781 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-15 12:39:49,781 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-15 12:39:49,782 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-15 12:39:49,782 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-15 12:39:49,782 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-15 12:39:49,782 INFO L290 TraceCheckUtils]: 141: Hoare triple {26293#false} ~cond := #in~cond; {26293#false} is VALID [2022-04-15 12:39:49,782 INFO L290 TraceCheckUtils]: 142: Hoare triple {26293#false} assume 0 == ~cond; {26293#false} is VALID [2022-04-15 12:39:49,782 INFO L290 TraceCheckUtils]: 143: Hoare triple {26293#false} assume !false; {26293#false} is VALID [2022-04-15 12:39:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 364 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 12:39:49,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:39:50,400 INFO L290 TraceCheckUtils]: 143: Hoare triple {26293#false} assume !false; {26293#false} is VALID [2022-04-15 12:39:50,400 INFO L290 TraceCheckUtils]: 142: Hoare triple {26293#false} assume 0 == ~cond; {26293#false} is VALID [2022-04-15 12:39:50,400 INFO L290 TraceCheckUtils]: 141: Hoare triple {26293#false} ~cond := #in~cond; {26293#false} is VALID [2022-04-15 12:39:50,400 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-15 12:39:50,401 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-15 12:39:50,401 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-15 12:39:50,402 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-15 12:39:50,402 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-15 12:39:50,402 INFO L290 TraceCheckUtils]: 135: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,402 INFO L290 TraceCheckUtils]: 134: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,402 INFO L290 TraceCheckUtils]: 133: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,402 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-15 12:39:50,403 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-15 12:39:50,403 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-15 12:39:50,403 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-15 12:39:50,404 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-15 12:39:50,404 INFO L290 TraceCheckUtils]: 127: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,404 INFO L290 TraceCheckUtils]: 126: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,404 INFO L290 TraceCheckUtils]: 125: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,404 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-15 12:39:50,404 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-15 12:39:50,405 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-15 12:39:50,405 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-15 12:39:50,405 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-15 12:39:50,406 INFO L290 TraceCheckUtils]: 119: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,406 INFO L290 TraceCheckUtils]: 118: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,406 INFO L290 TraceCheckUtils]: 117: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,406 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-15 12:39:50,406 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-15 12:39:50,406 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-15 12:39:50,407 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-15 12:39:50,407 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-15 12:39:50,407 INFO L290 TraceCheckUtils]: 111: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,407 INFO L290 TraceCheckUtils]: 110: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,407 INFO L290 TraceCheckUtils]: 109: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,408 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-15 12:39:50,408 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-15 12:39:50,408 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-15 12:39:50,408 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-15 12:39:50,409 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-15 12:39:50,409 INFO L290 TraceCheckUtils]: 103: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,409 INFO L290 TraceCheckUtils]: 102: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,409 INFO L290 TraceCheckUtils]: 101: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,409 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-15 12:39:50,409 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-15 12:39:50,410 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-15 12:39:50,410 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-15 12:39:50,411 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-15 12:39:50,411 INFO L290 TraceCheckUtils]: 95: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,411 INFO L290 TraceCheckUtils]: 94: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,411 INFO L290 TraceCheckUtils]: 93: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,411 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-15 12:39:50,411 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-15 12:39:50,412 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-15 12:39:50,412 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-15 12:39:50,413 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-15 12:39:50,413 INFO L290 TraceCheckUtils]: 87: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,413 INFO L290 TraceCheckUtils]: 86: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,413 INFO L290 TraceCheckUtils]: 85: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,413 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-15 12:39:50,413 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-15 12:39:50,413 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-15 12:39:50,414 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-15 12:39:50,414 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-15 12:39:50,414 INFO L290 TraceCheckUtils]: 79: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,414 INFO L290 TraceCheckUtils]: 78: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,414 INFO L290 TraceCheckUtils]: 77: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,414 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-15 12:39:50,415 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-15 12:39:50,415 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-15 12:39:50,415 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-15 12:39:50,416 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-15 12:39:50,416 INFO L290 TraceCheckUtils]: 71: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,416 INFO L290 TraceCheckUtils]: 70: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,416 INFO L290 TraceCheckUtils]: 69: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,416 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-15 12:39:50,417 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-15 12:39:50,417 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-15 12:39:50,417 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-15 12:39:50,418 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-15 12:39:50,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,418 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-15 12:39:50,418 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-15 12:39:50,419 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-15 12:39:50,419 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-15 12:39:50,419 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-15 12:39:50,419 INFO L290 TraceCheckUtils]: 55: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,420 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-15 12:39:50,420 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-15 12:39:50,420 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-15 12:39:50,421 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-15 12:39:50,421 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-15 12:39:50,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,421 INFO L290 TraceCheckUtils]: 46: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,421 INFO L290 TraceCheckUtils]: 45: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,421 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-15 12:39:50,422 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-15 12:39:50,422 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-15 12:39:50,422 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-15 12:39:50,423 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-15 12:39:50,423 INFO L290 TraceCheckUtils]: 39: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,423 INFO L290 TraceCheckUtils]: 38: Hoare triple {26292#true} assume !(0 == ~cond); {26292#true} is VALID [2022-04-15 12:39:50,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {26292#true} ~cond := #in~cond; {26292#true} is VALID [2022-04-15 12:39:50,423 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-15 12:39:50,423 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-15 12:39:50,424 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-15 12:39:50,424 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-15 12:39:50,424 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-15 12:39:50,425 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-15 12:39:50,425 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-15 12:39:50,425 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-15 12:39:50,426 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-15 12:39:50,426 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-15 12:39:50,426 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-15 12:39:50,427 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-15 12:39:50,427 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-15 12:39:50,427 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-15 12:39:50,428 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-15 12:39:50,428 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-15 12:39:50,428 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-15 12:39:50,429 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-15 12:39:50,429 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-15 12:39:50,429 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-15 12:39:50,430 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-15 12:39:50,430 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-15 12:39:50,430 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-15 12:39:50,431 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-15 12:39:50,431 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-15 12:39:50,431 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-15 12:39:50,432 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-15 12:39:50,432 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-15 12:39:50,432 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-15 12:39:50,433 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-15 12:39:50,433 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-15 12:39:50,433 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-15 12:39:50,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {26292#true} call #t~ret6 := main(); {26292#true} is VALID [2022-04-15 12:39:50,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26292#true} {26292#true} #70#return; {26292#true} is VALID [2022-04-15 12:39:50,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {26292#true} assume true; {26292#true} is VALID [2022-04-15 12:39:50,433 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-15 12:39:50,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {26292#true} call ULTIMATE.init(); {26292#true} is VALID [2022-04-15 12:39:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 364 proven. 169 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 12:39:50,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207183898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:39:50,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:39:50,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 48 [2022-04-15 12:39:50,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:50,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [181528472] [2022-04-15 12:39:50,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [181528472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:50,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:50,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:39:50,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708433682] [2022-04-15 12:39:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:50,435 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 144 [2022-04-15 12:39:50,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:50,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:50,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:50,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:39:50,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:39:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=1754, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:39:50,502 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:51,729 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2022-04-15 12:39:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:39:51,729 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 144 [2022-04-15 12:39:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-15 12:39:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 127 transitions. [2022-04-15 12:39:51,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 127 transitions. [2022-04-15 12:39:51,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:51,855 INFO L225 Difference]: With dead ends: 214 [2022-04-15 12:39:51,855 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 12:39:51,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1030, Invalid=4822, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:39:51,856 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 58 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:51,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 76 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:39:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 12:39:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-15 12:39:52,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:52,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:39:52,002 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:39:52,002 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:39:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:52,003 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-15 12:39:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-15 12:39:52,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:52,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:52,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-15 12:39:52,004 INFO L87 Difference]: Start difference. First operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 150 states. [2022-04-15 12:39:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:52,006 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2022-04-15 12:39:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2022-04-15 12:39:52,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:52,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:52,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:52,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 117 states have (on average 1.017094017094017) internal successors, (119), 118 states have internal predecessors, (119), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:39:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2022-04-15 12:39:52,009 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 144 [2022-04-15 12:39:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:52,009 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2022-04-15 12:39:52,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.4375) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:39:52,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 150 transitions. [2022-04-15 12:39:52,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2022-04-15 12:39:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-15 12:39:52,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:52,235 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:52,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 12:39:52,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 12:39:52,436 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:52,436 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 51 times [2022-04-15 12:39:52,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:52,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448254230] [2022-04-15 12:39:52,439 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:39:52,439 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:39:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash 564353732, now seen corresponding path program 52 times [2022-04-15 12:39:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:52,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276421926] [2022-04-15 12:39:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,964 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-15 12:39:52,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:52,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28342#true} {28342#true} #70#return; {28342#true} is VALID [2022-04-15 12:39:52,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 12:39:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:52,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:52,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:52,977 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-15 12:39:52,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 12:39:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:52,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:52,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:52,980 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-15 12:39:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 12:39:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:52,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:52,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:52,988 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-15 12:39:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 12:39:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:52,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:52,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:52,990 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-15 12:39:52,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 12:39:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:52,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:52,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:52,994 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-15 12:39:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-15 12:39:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:52,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:52,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:52,997 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-15 12:39:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-15 12:39:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:52,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:52,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:52,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:52,999 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-15 12:39:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 12:39:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:53,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,001 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-15 12:39:53,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-15 12:39:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:53,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,003 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-15 12:39:53,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-15 12:39:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:53,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,006 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-15 12:39:53,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-15 12:39:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:53,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,008 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-15 12:39:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-15 12:39:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:53,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,011 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-15 12:39:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-15 12:39:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:53,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,015 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-15 12:39:53,016 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-15 12:39:53,016 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-15 12:39:53,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28342#true} #70#return; {28342#true} is VALID [2022-04-15 12:39:53,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {28342#true} call #t~ret6 := main(); {28342#true} is VALID [2022-04-15 12:39:53,016 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-15 12:39:53,016 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-15 12:39:53,017 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-15 12:39:53,017 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-15 12:39:53,017 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-15 12:39:53,018 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-15 12:39:53,018 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-15 12:39:53,019 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-15 12:39:53,019 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-15 12:39:53,019 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-15 12:39:53,020 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-15 12:39:53,020 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-15 12:39:53,020 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-15 12:39:53,021 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-15 12:39:53,021 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-15 12:39:53,021 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-15 12:39:53,022 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-15 12:39:53,022 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-15 12:39:53,023 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-15 12:39:53,023 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-15 12:39:53,023 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-15 12:39:53,024 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-15 12:39:53,024 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-15 12:39:53,024 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-15 12:39:53,025 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-15 12:39:53,025 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-15 12:39:53,025 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-15 12:39:53,026 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-15 12:39:53,026 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-15 12:39:53,027 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-15 12:39:53,027 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-15 12:39:53,027 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-15 12:39:53,028 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-15 12:39:53,028 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-15 12:39:53,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,028 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-15 12:39:53,029 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-15 12:39:53,029 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-15 12:39:53,029 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-15 12:39:53,029 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-15 12:39:53,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,030 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-15 12:39:53,030 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-15 12:39:53,031 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-15 12:39:53,031 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-15 12:39:53,031 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-15 12:39:53,031 INFO L290 TraceCheckUtils]: 55: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,032 INFO L290 TraceCheckUtils]: 57: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,032 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-15 12:39:53,032 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-15 12:39:53,033 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-15 12:39:53,033 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-15 12:39:53,033 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-15 12:39:53,033 INFO L290 TraceCheckUtils]: 63: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,033 INFO L290 TraceCheckUtils]: 64: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,033 INFO L290 TraceCheckUtils]: 65: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,034 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-15 12:39:53,034 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-15 12:39:53,035 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-15 12:39:53,035 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-15 12:39:53,035 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-15 12:39:53,035 INFO L290 TraceCheckUtils]: 71: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,035 INFO L290 TraceCheckUtils]: 72: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,035 INFO L290 TraceCheckUtils]: 73: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,036 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-15 12:39:53,036 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-15 12:39:53,036 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-15 12:39:53,037 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-15 12:39:53,037 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-15 12:39:53,037 INFO L290 TraceCheckUtils]: 79: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,037 INFO L290 TraceCheckUtils]: 80: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,037 INFO L290 TraceCheckUtils]: 81: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,038 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-15 12:39:53,038 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-15 12:39:53,038 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-15 12:39:53,039 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-15 12:39:53,039 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-15 12:39:53,039 INFO L290 TraceCheckUtils]: 87: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,039 INFO L290 TraceCheckUtils]: 88: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,039 INFO L290 TraceCheckUtils]: 89: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,039 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-15 12:39:53,040 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-15 12:39:53,040 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-15 12:39:53,040 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-15 12:39:53,040 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-15 12:39:53,041 INFO L290 TraceCheckUtils]: 95: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,041 INFO L290 TraceCheckUtils]: 96: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,041 INFO L290 TraceCheckUtils]: 97: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,041 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-15 12:39:53,041 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-15 12:39:53,042 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-15 12:39:53,042 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-15 12:39:53,042 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-15 12:39:53,042 INFO L290 TraceCheckUtils]: 103: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,042 INFO L290 TraceCheckUtils]: 104: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,042 INFO L290 TraceCheckUtils]: 105: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,043 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-15 12:39:53,043 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-15 12:39:53,044 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-15 12:39:53,044 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-15 12:39:53,044 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-15 12:39:53,044 INFO L290 TraceCheckUtils]: 111: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,044 INFO L290 TraceCheckUtils]: 112: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,044 INFO L290 TraceCheckUtils]: 113: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,045 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-15 12:39:53,045 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-15 12:39:53,045 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-15 12:39:53,046 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-15 12:39:53,046 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-15 12:39:53,046 INFO L290 TraceCheckUtils]: 119: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,046 INFO L290 TraceCheckUtils]: 120: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,046 INFO L290 TraceCheckUtils]: 121: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,046 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-15 12:39:53,047 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-15 12:39:53,047 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-15 12:39:53,048 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-15 12:39:53,048 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-15 12:39:53,048 INFO L290 TraceCheckUtils]: 127: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,048 INFO L290 TraceCheckUtils]: 128: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,048 INFO L290 TraceCheckUtils]: 129: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,048 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-15 12:39:53,049 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-15 12:39:53,049 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-15 12:39:53,049 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-15 12:39:53,049 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-15 12:39:53,049 INFO L290 TraceCheckUtils]: 135: Hoare triple {28342#true} ~cond := #in~cond; {28342#true} is VALID [2022-04-15 12:39:53,050 INFO L290 TraceCheckUtils]: 136: Hoare triple {28342#true} assume !(0 == ~cond); {28342#true} is VALID [2022-04-15 12:39:53,050 INFO L290 TraceCheckUtils]: 137: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:39:53,050 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-15 12:39:53,050 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-15 12:39:53,051 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-15 12:39:53,051 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-15 12:39:53,051 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-15 12:39:53,052 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-15 12:39:53,052 INFO L290 TraceCheckUtils]: 144: Hoare triple {28431#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28343#false} is VALID [2022-04-15 12:39:53,052 INFO L290 TraceCheckUtils]: 145: Hoare triple {28343#false} assume !false; {28343#false} is VALID [2022-04-15 12:39:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 26 proven. 534 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 12:39:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:53,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276421926] [2022-04-15 12:39:53,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276421926] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:39:53,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815334689] [2022-04-15 12:39:53,053 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:39:53,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:39:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:39:53,054 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:39:53,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:39:53,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:39:53,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:39:53,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:39:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:53,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:39:53,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:40:04,377 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-04-15 12:40:04,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-04-15 12:40:04,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {28342#true} call ULTIMATE.init(); {28342#true} is VALID [2022-04-15 12:40:04,485 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-15 12:40:04,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {28342#true} assume true; {28342#true} is VALID [2022-04-15 12:40:04,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28342#true} {28342#true} #70#return; {28342#true} is VALID [2022-04-15 12:40:04,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {28342#true} call #t~ret6 := main(); {28342#true} is VALID [2022-04-15 12:40:04,486 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-15 12:40:04,486 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-15 12:40:04,486 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-15 12:40:04,487 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-15 12:40:04,487 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-15 12:40:04,487 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-15 12:40:04,488 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-15 12:40:04,488 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-15 12:40:04,488 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-15 12:40:04,489 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-15 12:40:04,489 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-15 12:40:04,489 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-15 12:40:04,490 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-15 12:40:04,490 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-15 12:40:04,490 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-15 12:40:04,491 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-15 12:40:04,491 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-15 12:40:04,491 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-15 12:40:04,492 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-15 12:40:04,492 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-15 12:40:04,492 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-15 12:40:04,493 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-15 12:40:04,493 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-15 12:40:04,493 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-15 12:40:04,494 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-15 12:40:04,494 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-15 12:40:04,494 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-15 12:40:04,495 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-15 12:40:04,495 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-15 12:40:04,497 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-15 12:40:04,497 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-15 12:40:04,498 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-15 12:40:04,498 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-15 12:40:04,499 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-15 12:40:04,499 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-15 12:40:04,500 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-15 12:40:04,500 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-15 12:40:04,500 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-15 12:40:04,501 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-15 12:40:04,501 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-15 12:40:04,502 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-15 12:40:04,503 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-15 12:40:04,503 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-15 12:40:04,503 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-15 12:40:04,504 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-15 12:40:04,504 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-15 12:40:04,505 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-15 12:40:04,505 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-15 12:40:04,506 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-15 12:40:04,507 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-15 12:40:04,507 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-15 12:40:04,507 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-15 12:40:04,508 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-15 12:40:04,508 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-15 12:40:04,509 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-15 12:40:04,509 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-15 12:40:04,510 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-15 12:40:04,510 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-15 12:40:04,511 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-15 12:40:04,511 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-15 12:40:04,511 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-15 12:40:04,512 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-15 12:40:04,512 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-15 12:40:04,513 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-15 12:40:04,513 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-15 12:40:04,514 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-15 12:40:04,515 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-15 12:40:04,515 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-15 12:40:04,515 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-15 12:40:04,516 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-15 12:40:04,516 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-15 12:40:04,517 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-15 12:40:04,517 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-15 12:40:04,518 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-15 12:40:04,518 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-15 12:40:04,519 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-15 12:40:04,519 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-15 12:40:04,519 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-15 12:40:04,520 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-15 12:40:04,520 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-15 12:40:04,521 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-15 12:40:04,522 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-15 12:40:04,522 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-15 12:40:04,522 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-15 12:40:04,523 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-15 12:40:04,523 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-15 12:40:04,524 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-15 12:40:04,524 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-15 12:40:04,525 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-15 12:40:04,526 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-15 12:40:04,526 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-15 12:40:04,526 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-15 12:40:04,527 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-15 12:40:04,527 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-15 12:40:04,528 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-15 12:40:04,528 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-15 12:40:04,529 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-15 12:40:04,529 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-15 12:40:04,530 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-15 12:40:04,530 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-15 12:40:04,530 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-15 12:40:04,531 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-15 12:40:04,531 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-15 12:40:04,532 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-15 12:40:04,532 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-15 12:40:04,533 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-15 12:40:04,534 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-15 12:40:04,534 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-15 12:40:04,534 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-15 12:40:04,535 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-15 12:40:04,535 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-15 12:40:04,536 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-15 12:40:04,536 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-15 12:40:04,537 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-15 12:40:04,537 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-15 12:40:04,538 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-15 12:40:04,538 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-15 12:40:04,539 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-15 12:40:04,539 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-15 12:40:04,540 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-15 12:40:04,540 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-15 12:40:04,541 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-15 12:40:04,541 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-15 12:40:04,542 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-15 12:40:04,542 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-15 12:40:04,542 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-15 12:40:04,543 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-15 12:40:04,543 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-15 12:40:04,544 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-15 12:40:04,545 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-15 12:40:04,545 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-15 12:40:04,545 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-15 12:40:04,546 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-15 12:40:04,546 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-15 12:40:04,547 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-15 12:40:04,547 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-15 12:40:04,548 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-15 12:40:04,548 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-15 12:40:04,549 INFO L290 TraceCheckUtils]: 143: Hoare triple {28894#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:40:04,549 INFO L290 TraceCheckUtils]: 144: Hoare triple {28898#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28343#false} is VALID [2022-04-15 12:40:04,549 INFO L290 TraceCheckUtils]: 145: Hoare triple {28343#false} assume !false; {28343#false} is VALID [2022-04-15 12:40:04,550 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 325 proven. 235 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 12:40:04,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:40:04,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815334689] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:40:04,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 12:40:04,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 70 [2022-04-15 12:40:04,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:40:04,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448254230] [2022-04-15 12:40:04,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448254230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:40:04,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:40:04,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:40:04,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088545649] [2022-04-15 12:40:04,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:40:04,878 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 146 [2022-04-15 12:40:04,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:40:04,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:40:04,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:40:04,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:40:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:40:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:40:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=4623, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 12:40:04,953 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:40:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:11,242 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2022-04-15 12:40:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:40:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Word has length 146 [2022-04-15 12:40:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:40:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:40:11,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-15 12:40:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:40:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 124 transitions. [2022-04-15 12:40:11,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 124 transitions. [2022-04-15 12:40:11,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:40:11,326 INFO L225 Difference]: With dead ends: 162 [2022-04-15 12:40:11,326 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 12:40:11,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 120 SyntacticMatches, 26 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=791, Invalid=10339, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 12:40:11,328 INFO L913 BasicCegarLoop]: 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-15 12:40:11,328 INFO L914 BasicCegarLoop]: 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-15 12:40:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 12:40:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-04-15 12:40:11,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:40:11,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:40:11,456 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:40:11,456 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:40:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:11,458 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-15 12:40:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-15 12:40:11,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:40:11,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:40:11,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-15 12:40:11,461 INFO L87 Difference]: Start difference. First operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-15 12:40:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:11,463 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-15 12:40:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-15 12:40:11,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:40:11,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:40:11,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:40:11,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:40:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 123 states have (on average 1.016260162601626) internal successors, (125), 124 states have internal predecessors, (125), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:40:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2022-04-15 12:40:11,465 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 146 [2022-04-15 12:40:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:40:11,465 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2022-04-15 12:40:11,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.2857142857142856) internal successors, (80), 34 states have internal predecessors, (80), 15 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 12:40:11,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 158 transitions. [2022-04-15 12:40:11,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:40:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2022-04-15 12:40:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-04-15 12:40:11,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:40:11,785 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:40:11,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 12:40:12,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 12:40:12,005 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:40:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:40:12,005 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 53 times [2022-04-15 12:40:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:40:12,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034943785] [2022-04-15 12:40:12,007 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:40:12,007 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:40:12,007 INFO L85 PathProgramCache]: Analyzing trace with hash -696599394, now seen corresponding path program 54 times [2022-04-15 12:40:12,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:40:12,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540954811] [2022-04-15 12:40:12,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:40:12,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:40:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:40:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,307 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-15 12:40:12,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,307 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-15 12:40:12,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-15 12:40:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,310 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-15 12:40:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-15 12:40:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,334 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-15 12:40:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-15 12:40:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,337 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-15 12:40:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-15 12:40:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,340 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-15 12:40:12,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-04-15 12:40:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,342 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-15 12:40:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-15 12:40:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,345 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-15 12:40:12,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-04-15 12:40:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,357 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-15 12:40:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-04-15 12:40:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,360 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-15 12:40:12,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-04-15 12:40:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,363 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-15 12:40:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-04-15 12:40:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,365 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-15 12:40:12,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-04-15 12:40:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,367 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-15 12:40:12,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-04-15 12:40:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,370 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-15 12:40:12,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-04-15 12:40:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,372 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-15 12:40:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-04-15 12:40:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,375 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-15 12:40:12,375 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-15 12:40:12,375 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-15 12:40:12,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-15 12:40:12,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-15 12:40:12,376 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-15 12:40:12,376 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-15 12:40:12,376 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-15 12:40:12,376 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-15 12:40:12,377 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-15 12:40:12,377 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-15 12:40:12,377 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-15 12:40:12,378 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-15 12:40:12,378 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-15 12:40:12,378 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-15 12:40:12,379 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-15 12:40:12,379 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-15 12:40:12,379 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-15 12:40:12,380 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-15 12:40:12,380 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-15 12:40:12,380 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-15 12:40:12,381 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-15 12:40:12,381 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-15 12:40:12,381 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-15 12:40:12,382 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-15 12:40:12,382 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-15 12:40:12,382 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-15 12:40:12,382 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-15 12:40:12,383 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-15 12:40:12,383 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-15 12:40:12,383 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-15 12:40:12,384 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-15 12:40:12,384 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-15 12:40:12,384 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-15 12:40:12,385 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-15 12:40:12,385 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-15 12:40:12,385 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-15 12:40:12,386 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-15 12:40:12,386 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-15 12:40:12,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,387 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-15 12:40:12,387 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-15 12:40:12,387 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-15 12:40:12,387 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-15 12:40:12,388 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-15 12:40:12,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,388 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-15 12:40:12,388 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-15 12:40:12,389 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-15 12:40:12,389 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-15 12:40:12,389 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-15 12:40:12,389 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,389 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,390 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-15 12:40:12,390 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-15 12:40:12,391 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-15 12:40:12,391 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-15 12:40:12,391 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-15 12:40:12,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,392 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-15 12:40:12,392 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-15 12:40:12,392 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-15 12:40:12,393 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-15 12:40:12,393 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-15 12:40:12,393 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,393 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,393 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,393 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-15 12:40:12,394 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-15 12:40:12,394 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-15 12:40:12,394 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-15 12:40:12,394 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-15 12:40:12,395 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,395 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,395 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,395 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-15 12:40:12,395 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-15 12:40:12,396 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-15 12:40:12,396 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-15 12:40:12,396 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-15 12:40:12,396 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,396 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,396 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,397 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-15 12:40:12,397 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-15 12:40:12,398 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-15 12:40:12,398 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-15 12:40:12,398 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-15 12:40:12,398 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,398 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,398 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,398 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-15 12:40:12,399 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-15 12:40:12,399 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-15 12:40:12,400 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-15 12:40:12,400 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-15 12:40:12,400 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,400 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,400 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,400 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-15 12:40:12,401 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-15 12:40:12,401 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-15 12:40:12,401 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-15 12:40:12,401 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-15 12:40:12,401 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,402 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,402 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,402 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-15 12:40:12,402 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-15 12:40:12,403 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-15 12:40:12,403 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-15 12:40:12,403 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-15 12:40:12,403 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,403 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,403 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,404 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-15 12:40:12,404 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-15 12:40:12,404 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-15 12:40:12,405 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-15 12:40:12,405 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-15 12:40:12,405 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,405 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,405 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,405 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-15 12:40:12,406 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-15 12:40:12,406 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-15 12:40:12,407 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-15 12:40:12,407 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-15 12:40:12,407 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,407 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,407 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,407 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-15 12:40:12,408 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-15 12:40:12,408 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-15 12:40:12,408 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-15 12:40:12,408 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-15 12:40:12,408 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:12,409 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:12,409 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:12,409 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-15 12:40:12,409 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-15 12:40:12,410 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-15 12:40:12,410 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-15 12:40:12,410 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-15 12:40:12,410 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-15 12:40:12,410 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-15 12:40:12,410 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-15 12:40:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 367 proven. 249 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 12:40:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:40:12,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540954811] [2022-04-15 12:40:12,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540954811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:40:12,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382702818] [2022-04-15 12:40:12,411 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:40:12,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:40:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:40:12,412 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:40:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:40:12,709 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-15 12:40:12,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:40:12,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:40:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:12,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:40:13,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {29956#true} call ULTIMATE.init(); {29956#true} is VALID [2022-04-15 12:40:13,621 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-15 12:40:13,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-15 12:40:13,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-15 12:40:13,621 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-15 12:40:13,621 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-15 12:40:13,621 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-15 12:40:13,622 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-15 12:40:13,622 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-15 12:40:13,622 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-15 12:40:13,623 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-15 12:40:13,623 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-15 12:40:13,623 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-15 12:40:13,623 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-15 12:40:13,624 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-15 12:40:13,624 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-15 12:40:13,624 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-15 12:40:13,625 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-15 12:40:13,625 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-15 12:40:13,625 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-15 12:40:13,625 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-15 12:40:13,626 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-15 12:40:13,626 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-15 12:40:13,626 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-15 12:40:13,626 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-15 12:40:13,627 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-15 12:40:13,627 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-15 12:40:13,627 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-15 12:40:13,628 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-15 12:40:13,628 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-15 12:40:13,628 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-15 12:40:13,628 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-15 12:40:13,629 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-15 12:40:13,629 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-15 12:40:13,629 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-15 12:40:13,630 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-15 12:40:13,630 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-15 12:40:13,630 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-15 12:40:13,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,631 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-15 12:40:13,631 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-15 12:40:13,631 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-15 12:40:13,631 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-15 12:40:13,632 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-15 12:40:13,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,632 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-15 12:40:13,632 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-15 12:40:13,633 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-15 12:40:13,633 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-15 12:40:13,633 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-15 12:40:13,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,633 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,633 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,634 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-15 12:40:13,634 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-15 12:40:13,634 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-15 12:40:13,635 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-15 12:40:13,635 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-15 12:40:13,635 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,635 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,635 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-15 12:40:13,636 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-15 12:40:13,636 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-15 12:40:13,636 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-15 12:40:13,636 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-15 12:40:13,636 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,636 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,637 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,637 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-15 12:40:13,637 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-15 12:40:13,638 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-15 12:40:13,638 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-15 12:40:13,638 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-15 12:40:13,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,638 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,638 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,639 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-15 12:40:13,639 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-15 12:40:13,639 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-15 12:40:13,639 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-15 12:40:13,640 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-15 12:40:13,640 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,640 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,640 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,640 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-15 12:40:13,640 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-15 12:40:13,641 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-15 12:40:13,641 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-15 12:40:13,641 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-15 12:40:13,641 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,641 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,641 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,642 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-15 12:40:13,642 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-15 12:40:13,642 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-15 12:40:13,643 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-15 12:40:13,643 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-15 12:40:13,643 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,643 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,643 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,643 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-15 12:40:13,644 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-15 12:40:13,644 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-15 12:40:13,644 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-15 12:40:13,644 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-15 12:40:13,644 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,644 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,645 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,645 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-15 12:40:13,645 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-15 12:40:13,646 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-15 12:40:13,646 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-15 12:40:13,646 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-15 12:40:13,646 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,646 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,646 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,646 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-15 12:40:13,647 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-15 12:40:13,647 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-15 12:40:13,647 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-15 12:40:13,647 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-15 12:40:13,648 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,648 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,648 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,648 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-15 12:40:13,648 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-15 12:40:13,649 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-15 12:40:13,649 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-15 12:40:13,649 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-15 12:40:13,649 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,649 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,649 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,650 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-15 12:40:13,650 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-15 12:40:13,650 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-15 12:40:13,651 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-15 12:40:13,651 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-15 12:40:13,651 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:13,651 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:13,651 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:13,651 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-15 12:40:13,652 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-15 12:40:13,652 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-15 12:40:13,652 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-15 12:40:13,652 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-15 12:40:13,652 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-15 12:40:13,652 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-15 12:40:13,653 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-15 12:40:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 420 proven. 196 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 12:40:13,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:40:14,290 INFO L290 TraceCheckUtils]: 153: Hoare triple {29957#false} assume !false; {29957#false} is VALID [2022-04-15 12:40:14,290 INFO L290 TraceCheckUtils]: 152: Hoare triple {29957#false} assume 0 == ~cond; {29957#false} is VALID [2022-04-15 12:40:14,291 INFO L290 TraceCheckUtils]: 151: Hoare triple {29957#false} ~cond := #in~cond; {29957#false} is VALID [2022-04-15 12:40:14,291 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-15 12:40:14,291 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-15 12:40:14,291 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-15 12:40:14,292 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-15 12:40:14,292 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-15 12:40:14,292 INFO L290 TraceCheckUtils]: 145: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,292 INFO L290 TraceCheckUtils]: 144: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,292 INFO L290 TraceCheckUtils]: 143: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,292 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-15 12:40:14,293 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-15 12:40:14,293 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-15 12:40:14,293 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-15 12:40:14,294 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-15 12:40:14,294 INFO L290 TraceCheckUtils]: 137: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,294 INFO L290 TraceCheckUtils]: 136: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,294 INFO L290 TraceCheckUtils]: 135: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,294 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-15 12:40:14,294 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-15 12:40:14,295 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-15 12:40:14,295 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-15 12:40:14,296 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-15 12:40:14,296 INFO L290 TraceCheckUtils]: 129: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,296 INFO L290 TraceCheckUtils]: 128: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,296 INFO L290 TraceCheckUtils]: 127: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,296 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-15 12:40:14,296 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-15 12:40:14,297 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-15 12:40:14,297 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-15 12:40:14,297 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-15 12:40:14,297 INFO L290 TraceCheckUtils]: 121: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,297 INFO L290 TraceCheckUtils]: 120: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,298 INFO L290 TraceCheckUtils]: 119: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,298 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-15 12:40:14,298 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-15 12:40:14,298 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-15 12:40:14,299 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-15 12:40:14,299 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-15 12:40:14,299 INFO L290 TraceCheckUtils]: 113: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,299 INFO L290 TraceCheckUtils]: 112: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,299 INFO L290 TraceCheckUtils]: 111: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,299 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-15 12:40:14,300 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-15 12:40:14,300 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-15 12:40:14,300 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-15 12:40:14,301 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-15 12:40:14,301 INFO L290 TraceCheckUtils]: 105: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,301 INFO L290 TraceCheckUtils]: 104: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,301 INFO L290 TraceCheckUtils]: 103: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,301 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-15 12:40:14,301 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-15 12:40:14,302 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-15 12:40:14,302 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-15 12:40:14,302 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-15 12:40:14,303 INFO L290 TraceCheckUtils]: 97: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,303 INFO L290 TraceCheckUtils]: 96: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,303 INFO L290 TraceCheckUtils]: 95: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,303 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-15 12:40:14,303 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-15 12:40:14,303 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-15 12:40:14,304 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-15 12:40:14,304 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-15 12:40:14,304 INFO L290 TraceCheckUtils]: 89: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,304 INFO L290 TraceCheckUtils]: 88: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,304 INFO L290 TraceCheckUtils]: 87: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,304 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-15 12:40:14,305 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-15 12:40:14,305 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-15 12:40:14,305 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-15 12:40:14,306 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-15 12:40:14,306 INFO L290 TraceCheckUtils]: 81: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,306 INFO L290 TraceCheckUtils]: 80: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,306 INFO L290 TraceCheckUtils]: 79: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,306 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-15 12:40:14,306 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-15 12:40:14,307 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-15 12:40:14,307 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-15 12:40:14,308 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-15 12:40:14,308 INFO L290 TraceCheckUtils]: 73: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,308 INFO L290 TraceCheckUtils]: 72: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,308 INFO L290 TraceCheckUtils]: 71: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,308 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-15 12:40:14,308 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-15 12:40:14,309 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-15 12:40:14,309 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-15 12:40:14,309 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-15 12:40:14,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,310 INFO L290 TraceCheckUtils]: 63: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,310 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-15 12:40:14,310 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-15 12:40:14,310 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-15 12:40:14,311 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-15 12:40:14,311 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-15 12:40:14,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,311 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-15 12:40:14,312 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-15 12:40:14,312 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-15 12:40:14,312 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-15 12:40:14,313 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-15 12:40:14,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,313 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-15 12:40:14,313 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-15 12:40:14,314 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-15 12:40:14,314 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-15 12:40:14,314 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-15 12:40:14,314 INFO L290 TraceCheckUtils]: 41: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,314 INFO L290 TraceCheckUtils]: 40: Hoare triple {29956#true} assume !(0 == ~cond); {29956#true} is VALID [2022-04-15 12:40:14,315 INFO L290 TraceCheckUtils]: 39: Hoare triple {29956#true} ~cond := #in~cond; {29956#true} is VALID [2022-04-15 12:40:14,315 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-15 12:40:14,315 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-15 12:40:14,315 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-15 12:40:14,316 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-15 12:40:14,316 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-15 12:40:14,316 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-15 12:40:14,317 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-15 12:40:14,317 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-15 12:40:14,317 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-15 12:40:14,318 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-15 12:40:14,318 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-15 12:40:14,318 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-15 12:40:14,319 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-15 12:40:14,319 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-15 12:40:14,319 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-15 12:40:14,320 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-15 12:40:14,320 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-15 12:40:14,320 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-15 12:40:14,321 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-15 12:40:14,321 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-15 12:40:14,321 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-15 12:40:14,321 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-15 12:40:14,322 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-15 12:40:14,322 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-15 12:40:14,322 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-15 12:40:14,323 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-15 12:40:14,323 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-15 12:40:14,323 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-15 12:40:14,324 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-15 12:40:14,324 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-15 12:40:14,324 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-15 12:40:14,325 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-15 12:40:14,325 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-15 12:40:14,325 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-15 12:40:14,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {29956#true} call #t~ret6 := main(); {29956#true} is VALID [2022-04-15 12:40:14,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29956#true} {29956#true} #70#return; {29956#true} is VALID [2022-04-15 12:40:14,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {29956#true} assume true; {29956#true} is VALID [2022-04-15 12:40:14,325 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-15 12:40:14,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {29956#true} call ULTIMATE.init(); {29956#true} is VALID [2022-04-15 12:40:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 420 proven. 196 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 12:40:14,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382702818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:40:14,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:40:14,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 51 [2022-04-15 12:40:14,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:40:14,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034943785] [2022-04-15 12:40:14,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034943785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:40:14,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:40:14,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:40:14,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714203061] [2022-04-15 12:40:14,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:40:14,327 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 154 [2022-04-15 12:40:14,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:40:14,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:40:14,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:40:14,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:40:14,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:40:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:40:14,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1983, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:40:14,398 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:40:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:16,186 INFO L93 Difference]: Finished difference Result 228 states and 244 transitions. [2022-04-15 12:40:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:40:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Word has length 154 [2022-04-15 12:40:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:40:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:40:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-15 12:40:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:40:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 134 transitions. [2022-04-15 12:40:16,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 134 transitions. [2022-04-15 12:40:16,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:40:16,305 INFO L225 Difference]: With dead ends: 228 [2022-04-15 12:40:16,305 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 12:40:16,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1162, Invalid=5480, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 12:40:16,306 INFO L913 BasicCegarLoop]: 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-15 12:40:16,306 INFO L914 BasicCegarLoop]: 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-15 12:40:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 12:40:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-04-15 12:40:16,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:40:16,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:40:16,448 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:40:16,448 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:40:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:16,450 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-15 12:40:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-15 12:40:16,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:40:16,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:40:16,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-15 12:40:16,451 INFO L87 Difference]: Start difference. First operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 160 states. [2022-04-15 12:40:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:40:16,452 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-04-15 12:40:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-04-15 12:40:16,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:40:16,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:40:16,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:40:16,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:40:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 125 states have (on average 1.016) internal successors, (127), 126 states have internal predecessors, (127), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:40:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-04-15 12:40:16,455 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 154 [2022-04-15 12:40:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:40:16,455 INFO L478 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-04-15 12:40:16,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 33 states have internal predecessors, (83), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:40:16,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 160 transitions. [2022-04-15 12:40:16,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:40:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-04-15 12:40:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-04-15 12:40:16,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:40:16,719 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:40:16,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:40:16,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 12:40:16,919 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:40:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:40:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 55 times [2022-04-15 12:40:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:40:16,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1000994122] [2022-04-15 12:40:16,922 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:40:16,922 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:40:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash -829694852, now seen corresponding path program 56 times [2022-04-15 12:40:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:40:16,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846070540] [2022-04-15 12:40:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:40:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:40:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:40:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,582 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-15 12:40:17,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32145#true} {32145#true} #70#return; {32145#true} is VALID [2022-04-15 12:40:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 12:40:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,585 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-15 12:40:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 12:40:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,588 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-15 12:40:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 12:40:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,590 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-15 12:40:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 12:40:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,592 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-15 12:40:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 12:40:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,609 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-15 12:40:17,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-15 12:40:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,612 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-15 12:40:17,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-15 12:40:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,614 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-15 12:40:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-15 12:40:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,619 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-15 12:40:17,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-15 12:40:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,621 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-15 12:40:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-15 12:40:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,623 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-15 12:40:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-04-15 12:40:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,626 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-15 12:40:17,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-04-15 12:40:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,634 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-15 12:40:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-04-15 12:40:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,637 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-15 12:40:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-15 12:40:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,639 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-15 12:40:17,639 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-15 12:40:17,639 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-15 12:40:17,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32145#true} #70#return; {32145#true} is VALID [2022-04-15 12:40:17,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {32145#true} call #t~ret6 := main(); {32145#true} is VALID [2022-04-15 12:40:17,640 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-15 12:40:17,640 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-15 12:40:17,640 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-15 12:40:17,641 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-15 12:40:17,641 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-15 12:40:17,641 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-15 12:40:17,642 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-15 12:40:17,642 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-15 12:40:17,643 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-15 12:40:17,643 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-15 12:40:17,643 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-15 12:40:17,644 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-15 12:40:17,644 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-15 12:40:17,645 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-15 12:40:17,645 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-15 12:40:17,645 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-15 12:40:17,646 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-15 12:40:17,646 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-15 12:40:17,646 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-15 12:40:17,647 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-15 12:40:17,647 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-15 12:40:17,647 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-15 12:40:17,648 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-15 12:40:17,648 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-15 12:40:17,649 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-15 12:40:17,649 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-15 12:40:17,649 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-15 12:40:17,650 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-15 12:40:17,650 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-15 12:40:17,650 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-15 12:40:17,651 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-15 12:40:17,651 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-15 12:40:17,652 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-15 12:40:17,652 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-15 12:40:17,652 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-15 12:40:17,652 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-15 12:40:17,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,653 INFO L290 TraceCheckUtils]: 42: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,653 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-15 12:40:17,653 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-15 12:40:17,654 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-15 12:40:17,654 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-15 12:40:17,654 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-15 12:40:17,654 INFO L290 TraceCheckUtils]: 49: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,654 INFO L290 TraceCheckUtils]: 50: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,655 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-15 12:40:17,655 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-15 12:40:17,656 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-15 12:40:17,656 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-15 12:40:17,656 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-15 12:40:17,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,656 INFO L290 TraceCheckUtils]: 59: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,657 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-15 12:40:17,657 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-15 12:40:17,658 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-15 12:40:17,658 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-15 12:40:17,658 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-15 12:40:17,658 INFO L290 TraceCheckUtils]: 65: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,659 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-15 12:40:17,659 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-15 12:40:17,660 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-15 12:40:17,660 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-15 12:40:17,660 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-15 12:40:17,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,660 INFO L290 TraceCheckUtils]: 75: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,661 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-15 12:40:17,661 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-15 12:40:17,662 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-15 12:40:17,662 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-15 12:40:17,662 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-15 12:40:17,662 INFO L290 TraceCheckUtils]: 81: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,662 INFO L290 TraceCheckUtils]: 82: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,662 INFO L290 TraceCheckUtils]: 83: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,663 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-15 12:40:17,663 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-15 12:40:17,664 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-15 12:40:17,664 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-15 12:40:17,664 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-15 12:40:17,664 INFO L290 TraceCheckUtils]: 89: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,664 INFO L290 TraceCheckUtils]: 90: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,664 INFO L290 TraceCheckUtils]: 91: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,665 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-15 12:40:17,665 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-15 12:40:17,666 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-15 12:40:17,666 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-15 12:40:17,666 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-15 12:40:17,666 INFO L290 TraceCheckUtils]: 97: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,666 INFO L290 TraceCheckUtils]: 98: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,666 INFO L290 TraceCheckUtils]: 99: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,667 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-15 12:40:17,667 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-15 12:40:17,668 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-15 12:40:17,668 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-15 12:40:17,668 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-15 12:40:17,668 INFO L290 TraceCheckUtils]: 105: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,668 INFO L290 TraceCheckUtils]: 106: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,668 INFO L290 TraceCheckUtils]: 107: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,669 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-15 12:40:17,669 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-15 12:40:17,669 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-15 12:40:17,670 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-15 12:40:17,670 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-15 12:40:17,670 INFO L290 TraceCheckUtils]: 113: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,670 INFO L290 TraceCheckUtils]: 114: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,670 INFO L290 TraceCheckUtils]: 115: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,671 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-15 12:40:17,671 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-15 12:40:17,671 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-15 12:40:17,672 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-15 12:40:17,672 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-15 12:40:17,672 INFO L290 TraceCheckUtils]: 121: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,672 INFO L290 TraceCheckUtils]: 122: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,672 INFO L290 TraceCheckUtils]: 123: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,672 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-15 12:40:17,673 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-15 12:40:17,673 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-15 12:40:17,674 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-15 12:40:17,674 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-15 12:40:17,674 INFO L290 TraceCheckUtils]: 129: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,674 INFO L290 TraceCheckUtils]: 130: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,674 INFO L290 TraceCheckUtils]: 131: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,674 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-15 12:40:17,675 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-15 12:40:17,675 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-15 12:40:17,676 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-15 12:40:17,676 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-15 12:40:17,676 INFO L290 TraceCheckUtils]: 137: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,676 INFO L290 TraceCheckUtils]: 138: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,676 INFO L290 TraceCheckUtils]: 139: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,676 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-15 12:40:17,677 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-15 12:40:17,677 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-15 12:40:17,678 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-15 12:40:17,678 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-15 12:40:17,678 INFO L290 TraceCheckUtils]: 145: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:40:17,678 INFO L290 TraceCheckUtils]: 146: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:40:17,678 INFO L290 TraceCheckUtils]: 147: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:40:17,678 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-15 12:40:17,679 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-15 12:40:17,679 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-15 12:40:17,680 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-15 12:40:17,680 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-15 12:40:17,680 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-15 12:40:17,681 INFO L290 TraceCheckUtils]: 154: Hoare triple {32240#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32146#false} is VALID [2022-04-15 12:40:17,681 INFO L290 TraceCheckUtils]: 155: Hoare triple {32146#false} assume !false; {32146#false} is VALID [2022-04-15 12:40:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 28 proven. 617 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 12:40:17,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:40:17,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846070540] [2022-04-15 12:40:17,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846070540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:40:17,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682421576] [2022-04-15 12:40:17,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:40:17,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:40:17,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:40:17,696 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:40:17,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:40:17,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:40:17,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:40:17,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 69 conjunts are in the unsatisfiable core [2022-04-15 12:40:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:40:17,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:40:17,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-04-15 12:46:12,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-15 12:46:12,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {32145#true} call ULTIMATE.init(); {32145#true} is VALID [2022-04-15 12:46:12,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#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); {32145#true} is VALID [2022-04-15 12:46:12,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:12,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32145#true} #70#return; {32145#true} is VALID [2022-04-15 12:46:12,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {32145#true} call #t~ret6 := main(); {32145#true} is VALID [2022-04-15 12:46:12,890 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-15 12:46:12,890 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-15 12:46:12,891 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-15 12:46:12,891 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-15 12:46:12,891 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-15 12:46:12,892 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-15 12:46:12,892 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-15 12:46:12,893 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-15 12:46:12,893 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-15 12:46:12,894 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-15 12:46:12,894 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-15 12:46:12,894 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-15 12:46:12,895 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-15 12:46:12,895 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-15 12:46:12,895 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-15 12:46:12,896 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-15 12:46:12,896 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-15 12:46:12,897 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-15 12:46:12,897 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-15 12:46:12,897 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-15 12:46:12,898 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-15 12:46:12,898 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-15 12:46:12,899 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-15 12:46:12,899 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-15 12:46:12,899 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-15 12:46:12,900 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-15 12:46:12,900 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-15 12:46:12,901 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-15 12:46:12,901 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-15 12:46:12,901 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-15 12:46:12,902 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); {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} is VALID [2022-04-15 12:46:12,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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-15 12:46:12,903 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-15 12:46:12,903 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-15 12:46:12,903 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-15 12:46:12,904 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)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,905 INFO L290 TraceCheckUtils]: 43: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,905 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {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-15 12:46:12,906 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-15 12:46:12,906 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; {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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); {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,907 INFO L272 TraceCheckUtils]: 48: Hoare triple {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 0 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,909 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 0 (+ (- 1) main_~i~1)))} #68#return; {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 0 (+ (- 1) main_~i~1)))} havoc #t~mem5; {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 0 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {32384#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 0 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 0))} is VALID [2022-04-15 12:46:12,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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); {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 0))} is VALID [2022-04-15 12:46:12,911 INFO L272 TraceCheckUtils]: 56: Hoare triple {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,912 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 0))} #68#return; {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 0))} is VALID [2022-04-15 12:46:12,912 INFO L290 TraceCheckUtils]: 61: Hoare triple {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 0))} havoc #t~mem5; {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 0))} is VALID [2022-04-15 12:46:12,913 INFO L290 TraceCheckUtils]: 62: Hoare triple {32409#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 3))} is VALID [2022-04-15 12:46:12,913 INFO L290 TraceCheckUtils]: 63: Hoare triple {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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); {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 3))} is VALID [2022-04-15 12:46:12,914 INFO L272 TraceCheckUtils]: 64: Hoare triple {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,914 INFO L290 TraceCheckUtils]: 65: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,914 INFO L290 TraceCheckUtils]: 66: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,915 INFO L290 TraceCheckUtils]: 67: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,915 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 3))} #68#return; {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 3))} is VALID [2022-04-15 12:46:12,915 INFO L290 TraceCheckUtils]: 69: Hoare triple {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 3))} havoc #t~mem5; {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 3))} is VALID [2022-04-15 12:46:12,916 INFO L290 TraceCheckUtils]: 70: Hoare triple {32434#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 4))} is VALID [2022-04-15 12:46:12,916 INFO L290 TraceCheckUtils]: 71: Hoare triple {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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); {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 4))} is VALID [2022-04-15 12:46:12,917 INFO L272 TraceCheckUtils]: 72: Hoare triple {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,917 INFO L290 TraceCheckUtils]: 73: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,918 INFO L290 TraceCheckUtils]: 74: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,918 INFO L290 TraceCheckUtils]: 75: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,918 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 4))} #68#return; {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 4))} is VALID [2022-04-15 12:46:12,919 INFO L290 TraceCheckUtils]: 77: Hoare triple {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 4))} havoc #t~mem5; {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 4))} is VALID [2022-04-15 12:46:12,919 INFO L290 TraceCheckUtils]: 78: Hoare triple {32459#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,919 INFO L290 TraceCheckUtils]: 79: Hoare triple {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,920 INFO L272 TraceCheckUtils]: 80: Hoare triple {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,936 INFO L290 TraceCheckUtils]: 82: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,936 INFO L290 TraceCheckUtils]: 83: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,937 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} #68#return; {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} havoc #t~mem5; {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,937 INFO L290 TraceCheckUtils]: 86: Hoare triple {32484#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 4 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} is VALID [2022-04-15 12:46:12,938 INFO L290 TraceCheckUtils]: 87: Hoare triple {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} is VALID [2022-04-15 12:46:12,939 INFO L272 TraceCheckUtils]: 88: Hoare triple {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,939 INFO L290 TraceCheckUtils]: 89: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,939 INFO L290 TraceCheckUtils]: 90: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,940 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} #68#return; {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} is VALID [2022-04-15 12:46:12,940 INFO L290 TraceCheckUtils]: 93: Hoare triple {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} havoc #t~mem5; {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} is VALID [2022-04-15 12:46:12,941 INFO L290 TraceCheckUtils]: 94: Hoare triple {32509#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} is VALID [2022-04-15 12:46:12,941 INFO L290 TraceCheckUtils]: 95: Hoare triple {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} is VALID [2022-04-15 12:46:12,942 INFO L272 TraceCheckUtils]: 96: Hoare triple {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,942 INFO L290 TraceCheckUtils]: 97: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,949 INFO L290 TraceCheckUtils]: 99: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,950 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} #68#return; {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} is VALID [2022-04-15 12:46:12,950 INFO L290 TraceCheckUtils]: 101: Hoare triple {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} havoc #t~mem5; {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} is VALID [2022-04-15 12:46:12,951 INFO L290 TraceCheckUtils]: 102: Hoare triple {32534#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ main_~i~1 (- 3)) 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} is VALID [2022-04-15 12:46:12,951 INFO L290 TraceCheckUtils]: 103: Hoare triple {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} is VALID [2022-04-15 12:46:12,952 INFO L272 TraceCheckUtils]: 104: Hoare triple {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,952 INFO L290 TraceCheckUtils]: 105: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,953 INFO L290 TraceCheckUtils]: 106: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,953 INFO L290 TraceCheckUtils]: 107: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,953 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} #68#return; {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} is VALID [2022-04-15 12:46:12,954 INFO L290 TraceCheckUtils]: 109: Hoare triple {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} havoc #t~mem5; {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} is VALID [2022-04-15 12:46:12,954 INFO L290 TraceCheckUtils]: 110: Hoare triple {32559#(and (= main_~i~1 8) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,955 INFO L290 TraceCheckUtils]: 111: Hoare triple {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,955 INFO L272 TraceCheckUtils]: 112: Hoare triple {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,956 INFO L290 TraceCheckUtils]: 113: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,956 INFO L290 TraceCheckUtils]: 114: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,956 INFO L290 TraceCheckUtils]: 115: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,957 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} #68#return; {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,957 INFO L290 TraceCheckUtils]: 117: Hoare triple {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} havoc #t~mem5; {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,958 INFO L290 TraceCheckUtils]: 118: Hoare triple {32584#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 8 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 10))} is VALID [2022-04-15 12:46:12,958 INFO L290 TraceCheckUtils]: 119: Hoare triple {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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); {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 10))} is VALID [2022-04-15 12:46:12,959 INFO L272 TraceCheckUtils]: 120: Hoare triple {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,959 INFO L290 TraceCheckUtils]: 121: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,959 INFO L290 TraceCheckUtils]: 122: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,960 INFO L290 TraceCheckUtils]: 123: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,960 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 10))} #68#return; {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 10))} is VALID [2022-04-15 12:46:12,960 INFO L290 TraceCheckUtils]: 125: Hoare triple {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 10))} havoc #t~mem5; {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 10))} is VALID [2022-04-15 12:46:12,961 INFO L290 TraceCheckUtils]: 126: Hoare triple {32609#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,961 INFO L290 TraceCheckUtils]: 127: Hoare triple {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,962 INFO L272 TraceCheckUtils]: 128: Hoare triple {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,962 INFO L290 TraceCheckUtils]: 129: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,963 INFO L290 TraceCheckUtils]: 130: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,963 INFO L290 TraceCheckUtils]: 131: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,963 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} #68#return; {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,964 INFO L290 TraceCheckUtils]: 133: Hoare triple {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} havoc #t~mem5; {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} is VALID [2022-04-15 12:46:12,964 INFO L290 TraceCheckUtils]: 134: Hoare triple {32634#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= 10 (+ (- 1) main_~i~1)))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} is VALID [2022-04-15 12:46:12,965 INFO L290 TraceCheckUtils]: 135: Hoare triple {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} is VALID [2022-04-15 12:46:12,965 INFO L272 TraceCheckUtils]: 136: Hoare triple {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,966 INFO L290 TraceCheckUtils]: 137: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,966 INFO L290 TraceCheckUtils]: 138: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,966 INFO L290 TraceCheckUtils]: 139: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,967 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} #68#return; {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} is VALID [2022-04-15 12:46:12,967 INFO L290 TraceCheckUtils]: 141: Hoare triple {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} havoc #t~mem5; {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} is VALID [2022-04-15 12:46:12,967 INFO L290 TraceCheckUtils]: 142: Hoare triple {32659#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= (+ (- 2) main_~i~1) 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 13))} is VALID [2022-04-15 12:46:12,968 INFO L290 TraceCheckUtils]: 143: Hoare triple {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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); {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 13))} is VALID [2022-04-15 12:46:12,969 INFO L272 TraceCheckUtils]: 144: Hoare triple {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,969 INFO L290 TraceCheckUtils]: 145: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} ~cond := #in~cond; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,969 INFO L290 TraceCheckUtils]: 146: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume !(0 == ~cond); {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,969 INFO L290 TraceCheckUtils]: 147: Hoare triple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} assume true; {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} is VALID [2022-04-15 12:46:12,970 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {32365#(exists ((v_main_~x~0.base_BEFORE_CALL_111 Int) (v_main_~x~0.offset_BEFORE_CALL_111 Int)) (= (select (select |#memory_int| v_main_~x~0.base_BEFORE_CALL_111) (+ 56 v_main_~x~0.offset_BEFORE_CALL_111)) 0))} {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 13))} #68#return; {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 13))} is VALID [2022-04-15 12:46:12,975 INFO L290 TraceCheckUtils]: 149: Hoare triple {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 13))} havoc #t~mem5; {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 13))} is VALID [2022-04-15 12:46:12,976 INFO L290 TraceCheckUtils]: 150: Hoare triple {32684#(and (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0) (= main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {32709#(and (= main_~i~1 14) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0))} is VALID [2022-04-15 12:46:12,976 INFO L290 TraceCheckUtils]: 151: Hoare triple {32709#(and (= main_~i~1 14) (= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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-15 12:46:12,976 INFO L272 TraceCheckUtils]: 152: Hoare triple {32238#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32716#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:12,977 INFO L290 TraceCheckUtils]: 153: Hoare triple {32716#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32720#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:46:12,977 INFO L290 TraceCheckUtils]: 154: Hoare triple {32720#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {32146#false} is VALID [2022-04-15 12:46:12,977 INFO L290 TraceCheckUtils]: 155: Hoare triple {32146#false} assume !false; {32146#false} is VALID [2022-04-15 12:46:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 0 proven. 645 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 12:46:12,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:15,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-04-15 12:46:15,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-04-15 12:46:15,648 INFO L290 TraceCheckUtils]: 155: Hoare triple {32146#false} assume !false; {32146#false} is VALID [2022-04-15 12:46:15,649 INFO L290 TraceCheckUtils]: 154: Hoare triple {32720#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {32146#false} is VALID [2022-04-15 12:46:15,649 INFO L290 TraceCheckUtils]: 153: Hoare triple {32716#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32720#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:46:15,650 INFO L272 TraceCheckUtils]: 152: Hoare triple {32238#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32716#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:15,650 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-15 12:46:15,650 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-15 12:46:15,651 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-15 12:46:15,651 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-15 12:46:15,652 INFO L290 TraceCheckUtils]: 147: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,652 INFO L290 TraceCheckUtils]: 146: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,652 INFO L290 TraceCheckUtils]: 145: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,652 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-15 12:46:15,652 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-15 12:46:15,653 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-15 12:46:15,653 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-15 12:46:15,654 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-15 12:46:15,654 INFO L290 TraceCheckUtils]: 139: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,654 INFO L290 TraceCheckUtils]: 138: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,654 INFO L290 TraceCheckUtils]: 137: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,654 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-15 12:46:15,654 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-15 12:46:15,655 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-15 12:46:15,655 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-15 12:46:15,656 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-15 12:46:15,656 INFO L290 TraceCheckUtils]: 131: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,656 INFO L290 TraceCheckUtils]: 130: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,656 INFO L290 TraceCheckUtils]: 129: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,656 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-15 12:46:15,656 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-15 12:46:15,657 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-15 12:46:15,657 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-15 12:46:15,658 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-15 12:46:15,658 INFO L290 TraceCheckUtils]: 123: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,658 INFO L290 TraceCheckUtils]: 122: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,658 INFO L290 TraceCheckUtils]: 121: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,658 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-15 12:46:15,658 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-15 12:46:15,659 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-15 12:46:15,659 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-15 12:46:15,660 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-15 12:46:15,660 INFO L290 TraceCheckUtils]: 115: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,660 INFO L290 TraceCheckUtils]: 114: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,660 INFO L290 TraceCheckUtils]: 113: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,660 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-15 12:46:15,660 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-15 12:46:15,661 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-15 12:46:15,661 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-15 12:46:15,662 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-15 12:46:15,662 INFO L290 TraceCheckUtils]: 107: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,662 INFO L290 TraceCheckUtils]: 106: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,662 INFO L290 TraceCheckUtils]: 105: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,662 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-15 12:46:15,662 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-15 12:46:15,663 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-15 12:46:15,663 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-15 12:46:15,664 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-15 12:46:15,664 INFO L290 TraceCheckUtils]: 99: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,664 INFO L290 TraceCheckUtils]: 98: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,664 INFO L290 TraceCheckUtils]: 97: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,664 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-15 12:46:15,664 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-15 12:46:15,665 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-15 12:46:15,665 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-15 12:46:15,666 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-15 12:46:15,666 INFO L290 TraceCheckUtils]: 91: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,666 INFO L290 TraceCheckUtils]: 90: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,666 INFO L290 TraceCheckUtils]: 89: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,666 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-15 12:46:15,666 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-15 12:46:15,667 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-15 12:46:15,667 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-15 12:46:15,668 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-15 12:46:15,668 INFO L290 TraceCheckUtils]: 83: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,668 INFO L290 TraceCheckUtils]: 82: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,668 INFO L290 TraceCheckUtils]: 81: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,668 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-15 12:46:15,668 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-15 12:46:15,669 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-15 12:46:15,669 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-15 12:46:15,670 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-15 12:46:15,670 INFO L290 TraceCheckUtils]: 75: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,670 INFO L290 TraceCheckUtils]: 74: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,670 INFO L290 TraceCheckUtils]: 73: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,670 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-15 12:46:15,670 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-15 12:46:15,671 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-15 12:46:15,671 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-15 12:46:15,672 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-15 12:46:15,672 INFO L290 TraceCheckUtils]: 67: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,672 INFO L290 TraceCheckUtils]: 65: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,672 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-15 12:46:15,672 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-15 12:46:15,673 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-15 12:46:15,673 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-15 12:46:15,674 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-15 12:46:15,674 INFO L290 TraceCheckUtils]: 59: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,674 INFO L290 TraceCheckUtils]: 58: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,674 INFO L290 TraceCheckUtils]: 57: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,674 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-15 12:46:15,674 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-15 12:46:15,675 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-15 12:46:15,675 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-15 12:46:15,676 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-15 12:46:15,676 INFO L290 TraceCheckUtils]: 51: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,676 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-15 12:46:15,676 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-15 12:46:15,677 INFO L290 TraceCheckUtils]: 46: Hoare triple {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 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-15 12:46:15,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} havoc #t~mem5; {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:15,678 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {32145#true} {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} #68#return; {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:15,678 INFO L290 TraceCheckUtils]: 43: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {32145#true} assume !(0 == ~cond); {32145#true} is VALID [2022-04-15 12:46:15,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {32145#true} ~cond := #in~cond; {32145#true} is VALID [2022-04-15 12:46:15,678 INFO L272 TraceCheckUtils]: 40: Hoare triple {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {32145#true} is VALID [2022-04-15 12:46:15,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 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); {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:15,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} ~i~1 := 0; {33054#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:15,679 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-15 12:46:15,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 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-15 12:46:15,680 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); {32166#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset)) 0)} is VALID [2022-04-15 12:46:15,680 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-15 12:46:15,681 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-15 12:46:15,681 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-15 12:46:15,681 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-15 12:46:15,682 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-15 12:46:15,682 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-15 12:46:15,683 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-15 12:46:15,683 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-15 12:46:15,683 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-15 12:46:15,684 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-15 12:46:15,684 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-15 12:46:15,685 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-15 12:46:15,685 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-15 12:46:15,685 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-15 12:46:15,686 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-15 12:46:15,686 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-15 12:46:15,687 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-15 12:46:15,687 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-15 12:46:15,687 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-15 12:46:15,688 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-15 12:46:15,688 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-15 12:46:15,689 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-15 12:46:15,689 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-15 12:46:15,689 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-15 12:46:15,690 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-15 12:46:15,690 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-15 12:46:15,691 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-15 12:46:15,691 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-15 12:46:15,691 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-15 12:46:15,691 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-15 12:46:15,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {32145#true} call #t~ret6 := main(); {32145#true} is VALID [2022-04-15 12:46:15,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32145#true} {32145#true} #70#return; {32145#true} is VALID [2022-04-15 12:46:15,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {32145#true} assume true; {32145#true} is VALID [2022-04-15 12:46:15,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {32145#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); {32145#true} is VALID [2022-04-15 12:46:15,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {32145#true} call ULTIMATE.init(); {32145#true} is VALID [2022-04-15 12:46:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 28 proven. 617 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 12:46:15,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682421576] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:15,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:15,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 36] total 56 [2022-04-15 12:46:15,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:15,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1000994122] [2022-04-15 12:46:15,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1000994122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:15,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:15,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:46:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332906270] [2022-04-15 12:46:15,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:15,693 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 36 states have internal predecessors, (85), 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 156 [2022-04-15 12:46:15,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:15,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 36 states have internal predecessors, (85), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:46:15,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:15,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:46:15,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:15,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:46:15,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2905, Unknown=15, NotChecked=0, Total=3080 [2022-04-15 12:46:15,775 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 36 states have internal predecessors, (85), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:46:21,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:21,534 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2022-04-15 12:46:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:46:21,534 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 36 states have internal predecessors, (85), 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 156 [2022-04-15 12:46:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 36 states have internal predecessors, (85), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:46:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 131 transitions. [2022-04-15 12:46:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 36 states have internal predecessors, (85), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:46:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 131 transitions. [2022-04-15 12:46:21,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 131 transitions. [2022-04-15 12:46:21,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:21,646 INFO L225 Difference]: With dead ends: 172 [2022-04-15 12:46:21,647 INFO L226 Difference]: Without dead ends: 170 [2022-04-15 12:46:21,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 292 SyntacticMatches, 32 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 356.4s TimeCoverageRelationStatistics Valid=364, Invalid=7993, Unknown=15, NotChecked=0, Total=8372 [2022-04-15 12:46:21,647 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 100 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3986 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 3986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:21,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 197 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 3986 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 12:46:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-15 12:46:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2022-04-15 12:46:21,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:21,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 167 states, 131 states have (on average 1.015267175572519) internal successors, (133), 132 states have internal predecessors, (133), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 12:46:21,810 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 167 states, 131 states have (on average 1.015267175572519) internal successors, (133), 132 states have internal predecessors, (133), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 12:46:21,811 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 167 states, 131 states have (on average 1.015267175572519) internal successors, (133), 132 states have internal predecessors, (133), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 12:46:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:21,812 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2022-04-15 12:46:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2022-04-15 12:46:21,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:21,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:21,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 131 states have (on average 1.015267175572519) internal successors, (133), 132 states have internal predecessors, (133), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 170 states. [2022-04-15 12:46:21,813 INFO L87 Difference]: Start difference. First operand has 167 states, 131 states have (on average 1.015267175572519) internal successors, (133), 132 states have internal predecessors, (133), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 170 states. [2022-04-15 12:46:21,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:21,817 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2022-04-15 12:46:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2022-04-15 12:46:21,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:21,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:21,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:21,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 131 states have (on average 1.015267175572519) internal successors, (133), 132 states have internal predecessors, (133), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 12:46:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2022-04-15 12:46:21,820 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 156 [2022-04-15 12:46:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:21,821 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2022-04-15 12:46:21,821 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 36 states have internal predecessors, (85), 16 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-15 12:46:21,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 167 states and 168 transitions. [2022-04-15 12:46:22,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2022-04-15 12:46:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-15 12:46:22,123 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:22,123 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:22,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:22,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:22,323 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:22,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:22,323 INFO L85 PathProgramCache]: Analyzing trace with hash 679609942, now seen corresponding path program 57 times [2022-04-15 12:46:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:22,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2022950930] [2022-04-15 12:46:22,326 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:46:22,326 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:46:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash 679609942, now seen corresponding path program 58 times [2022-04-15 12:46:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:22,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316839976] [2022-04-15 12:46:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {34383#(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); {34285#true} is VALID [2022-04-15 12:46:22,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34285#true} {34285#true} #70#return; {34285#true} is VALID [2022-04-15 12:46:22,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-04-15 12:46:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} #68#return; {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} is VALID [2022-04-15 12:46:22,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 12:46:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34312#(<= main_~n~0 (+ main_~i~1 14))} #68#return; {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-15 12:46:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34317#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-15 12:46:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34322#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:22,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-04-15 12:46:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34327#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-04-15 12:46:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34332#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-04-15 12:46:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34337#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-04-15 12:46:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34342#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-04-15 12:46:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34347#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-04-15 12:46:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34352#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-04-15 12:46:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34357#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:22,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-04-15 12:46:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34362#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:22,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-04-15 12:46:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34367#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:22,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-04-15 12:46:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34372#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-04-15 12:46:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:22,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34377#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:22,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {34285#true} call ULTIMATE.init(); {34383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:22,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {34383#(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); {34285#true} is VALID [2022-04-15 12:46:22,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34285#true} #70#return; {34285#true} is VALID [2022-04-15 12:46:22,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {34285#true} call #t~ret6 := main(); {34285#true} is VALID [2022-04-15 12:46:22,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {34285#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {34285#true} is VALID [2022-04-15 12:46:22,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {34285#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; {34290#(= main_~i~0 0)} is VALID [2022-04-15 12:46:22,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {34290#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34290#(= main_~i~0 0)} is VALID [2022-04-15 12:46:22,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {34290#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34291#(<= main_~i~0 1)} is VALID [2022-04-15 12:46:22,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {34291#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34291#(<= main_~i~0 1)} is VALID [2022-04-15 12:46:22,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {34291#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34292#(<= main_~i~0 2)} is VALID [2022-04-15 12:46:22,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {34292#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34292#(<= main_~i~0 2)} is VALID [2022-04-15 12:46:22,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {34292#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34293#(<= main_~i~0 3)} is VALID [2022-04-15 12:46:22,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {34293#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34293#(<= main_~i~0 3)} is VALID [2022-04-15 12:46:22,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {34293#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34294#(<= main_~i~0 4)} is VALID [2022-04-15 12:46:22,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {34294#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34294#(<= main_~i~0 4)} is VALID [2022-04-15 12:46:22,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {34294#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34295#(<= main_~i~0 5)} is VALID [2022-04-15 12:46:22,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {34295#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34295#(<= main_~i~0 5)} is VALID [2022-04-15 12:46:22,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {34295#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34296#(<= main_~i~0 6)} is VALID [2022-04-15 12:46:22,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {34296#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34296#(<= main_~i~0 6)} is VALID [2022-04-15 12:46:22,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {34296#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34297#(<= main_~i~0 7)} is VALID [2022-04-15 12:46:22,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {34297#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34297#(<= main_~i~0 7)} is VALID [2022-04-15 12:46:22,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {34297#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34298#(<= main_~i~0 8)} is VALID [2022-04-15 12:46:22,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {34298#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34298#(<= main_~i~0 8)} is VALID [2022-04-15 12:46:22,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {34298#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34299#(<= main_~i~0 9)} is VALID [2022-04-15 12:46:22,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {34299#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34299#(<= main_~i~0 9)} is VALID [2022-04-15 12:46:22,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {34299#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34300#(<= main_~i~0 10)} is VALID [2022-04-15 12:46:22,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {34300#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34300#(<= main_~i~0 10)} is VALID [2022-04-15 12:46:22,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {34300#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34301#(<= main_~i~0 11)} is VALID [2022-04-15 12:46:22,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {34301#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34301#(<= main_~i~0 11)} is VALID [2022-04-15 12:46:22,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {34301#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34302#(<= main_~i~0 12)} is VALID [2022-04-15 12:46:22,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {34302#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34302#(<= main_~i~0 12)} is VALID [2022-04-15 12:46:22,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {34302#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34303#(<= main_~i~0 13)} is VALID [2022-04-15 12:46:22,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {34303#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34303#(<= main_~i~0 13)} is VALID [2022-04-15 12:46:22,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {34303#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34304#(<= main_~i~0 14)} is VALID [2022-04-15 12:46:22,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {34304#(<= main_~i~0 14)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34304#(<= main_~i~0 14)} is VALID [2022-04-15 12:46:22,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {34304#(<= main_~i~0 14)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34305#(<= main_~i~0 15)} is VALID [2022-04-15 12:46:22,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {34305#(<= main_~i~0 15)} assume !(~i~0 < ~n~0); {34306#(<= main_~n~0 15)} is VALID [2022-04-15 12:46:22,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {34306#(<= main_~n~0 15)} ~i~1 := 0; {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} is VALID [2022-04-15 12:46:22,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} is VALID [2022-04-15 12:46:22,791 INFO L272 TraceCheckUtils]: 40: Hoare triple {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,792 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {34285#true} {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} #68#return; {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} is VALID [2022-04-15 12:46:22,792 INFO L290 TraceCheckUtils]: 45: Hoare triple {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} havoc #t~mem5; {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} is VALID [2022-04-15 12:46:22,792 INFO L290 TraceCheckUtils]: 46: Hoare triple {34307#(and (<= main_~n~0 15) (= main_~i~1 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:22,793 INFO L290 TraceCheckUtils]: 47: Hoare triple {34312#(<= 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); {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:22,793 INFO L272 TraceCheckUtils]: 48: Hoare triple {34312#(<= main_~n~0 (+ main_~i~1 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,793 INFO L290 TraceCheckUtils]: 49: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,793 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34285#true} {34312#(<= main_~n~0 (+ main_~i~1 14))} #68#return; {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:22,794 INFO L290 TraceCheckUtils]: 53: Hoare triple {34312#(<= main_~n~0 (+ main_~i~1 14))} havoc #t~mem5; {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:22,794 INFO L290 TraceCheckUtils]: 54: Hoare triple {34312#(<= main_~n~0 (+ main_~i~1 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:22,794 INFO L290 TraceCheckUtils]: 55: Hoare triple {34317#(<= 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); {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:22,794 INFO L272 TraceCheckUtils]: 56: Hoare triple {34317#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,795 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {34285#true} {34317#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:22,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {34317#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:22,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {34317#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:22,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {34322#(<= 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); {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:22,796 INFO L272 TraceCheckUtils]: 64: Hoare triple {34322#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,796 INFO L290 TraceCheckUtils]: 67: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,796 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {34285#true} {34322#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:22,797 INFO L290 TraceCheckUtils]: 69: Hoare triple {34322#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:22,797 INFO L290 TraceCheckUtils]: 70: Hoare triple {34322#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:22,797 INFO L290 TraceCheckUtils]: 71: Hoare triple {34327#(<= 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); {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:22,797 INFO L272 TraceCheckUtils]: 72: Hoare triple {34327#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,797 INFO L290 TraceCheckUtils]: 73: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,798 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {34285#true} {34327#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:22,798 INFO L290 TraceCheckUtils]: 77: Hoare triple {34327#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:22,799 INFO L290 TraceCheckUtils]: 78: Hoare triple {34327#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:22,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {34332#(<= 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); {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:22,799 INFO L272 TraceCheckUtils]: 80: Hoare triple {34332#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,800 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {34285#true} {34332#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:22,800 INFO L290 TraceCheckUtils]: 85: Hoare triple {34332#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:22,800 INFO L290 TraceCheckUtils]: 86: Hoare triple {34332#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:22,800 INFO L290 TraceCheckUtils]: 87: Hoare triple {34337#(<= 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); {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:22,801 INFO L272 TraceCheckUtils]: 88: Hoare triple {34337#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,801 INFO L290 TraceCheckUtils]: 89: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,801 INFO L290 TraceCheckUtils]: 90: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,801 INFO L290 TraceCheckUtils]: 91: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,801 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {34285#true} {34337#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:22,801 INFO L290 TraceCheckUtils]: 93: Hoare triple {34337#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:22,802 INFO L290 TraceCheckUtils]: 94: Hoare triple {34337#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:22,802 INFO L290 TraceCheckUtils]: 95: Hoare triple {34342#(<= 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); {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:22,802 INFO L272 TraceCheckUtils]: 96: Hoare triple {34342#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,802 INFO L290 TraceCheckUtils]: 97: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,802 INFO L290 TraceCheckUtils]: 98: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,802 INFO L290 TraceCheckUtils]: 99: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,803 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {34285#true} {34342#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:22,803 INFO L290 TraceCheckUtils]: 101: Hoare triple {34342#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:22,803 INFO L290 TraceCheckUtils]: 102: Hoare triple {34342#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:22,804 INFO L290 TraceCheckUtils]: 103: Hoare triple {34347#(<= 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); {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:22,804 INFO L272 TraceCheckUtils]: 104: Hoare triple {34347#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,804 INFO L290 TraceCheckUtils]: 105: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,804 INFO L290 TraceCheckUtils]: 106: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,804 INFO L290 TraceCheckUtils]: 107: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,804 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34285#true} {34347#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:22,804 INFO L290 TraceCheckUtils]: 109: Hoare triple {34347#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:22,805 INFO L290 TraceCheckUtils]: 110: Hoare triple {34347#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:22,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {34352#(<= 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); {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:22,805 INFO L272 TraceCheckUtils]: 112: Hoare triple {34352#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,805 INFO L290 TraceCheckUtils]: 113: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,805 INFO L290 TraceCheckUtils]: 114: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,805 INFO L290 TraceCheckUtils]: 115: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,806 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {34285#true} {34352#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:22,806 INFO L290 TraceCheckUtils]: 117: Hoare triple {34352#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:22,807 INFO L290 TraceCheckUtils]: 118: Hoare triple {34352#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:22,807 INFO L290 TraceCheckUtils]: 119: Hoare triple {34357#(<= 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); {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:22,807 INFO L272 TraceCheckUtils]: 120: Hoare triple {34357#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,807 INFO L290 TraceCheckUtils]: 121: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,807 INFO L290 TraceCheckUtils]: 122: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,807 INFO L290 TraceCheckUtils]: 123: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,807 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {34285#true} {34357#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:22,808 INFO L290 TraceCheckUtils]: 125: Hoare triple {34357#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:22,808 INFO L290 TraceCheckUtils]: 126: Hoare triple {34357#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:22,808 INFO L290 TraceCheckUtils]: 127: Hoare triple {34362#(<= 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); {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:22,808 INFO L272 TraceCheckUtils]: 128: Hoare triple {34362#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,808 INFO L290 TraceCheckUtils]: 129: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,808 INFO L290 TraceCheckUtils]: 130: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,809 INFO L290 TraceCheckUtils]: 131: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,809 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {34285#true} {34362#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:22,809 INFO L290 TraceCheckUtils]: 133: Hoare triple {34362#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:22,810 INFO L290 TraceCheckUtils]: 134: Hoare triple {34362#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:22,810 INFO L290 TraceCheckUtils]: 135: Hoare triple {34367#(<= 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); {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:22,810 INFO L272 TraceCheckUtils]: 136: Hoare triple {34367#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,810 INFO L290 TraceCheckUtils]: 137: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,810 INFO L290 TraceCheckUtils]: 138: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,810 INFO L290 TraceCheckUtils]: 139: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,811 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {34285#true} {34367#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:22,811 INFO L290 TraceCheckUtils]: 141: Hoare triple {34367#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:22,811 INFO L290 TraceCheckUtils]: 142: Hoare triple {34367#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:22,812 INFO L290 TraceCheckUtils]: 143: Hoare triple {34372#(<= 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); {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:22,812 INFO L272 TraceCheckUtils]: 144: Hoare triple {34372#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,812 INFO L290 TraceCheckUtils]: 145: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,812 INFO L290 TraceCheckUtils]: 146: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,812 INFO L290 TraceCheckUtils]: 147: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,812 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {34285#true} {34372#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:22,812 INFO L290 TraceCheckUtils]: 149: Hoare triple {34372#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:22,813 INFO L290 TraceCheckUtils]: 150: Hoare triple {34372#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:22,813 INFO L290 TraceCheckUtils]: 151: Hoare triple {34377#(<= 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); {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:22,813 INFO L272 TraceCheckUtils]: 152: Hoare triple {34377#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:22,813 INFO L290 TraceCheckUtils]: 153: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:22,813 INFO L290 TraceCheckUtils]: 154: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:22,813 INFO L290 TraceCheckUtils]: 155: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:22,814 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {34285#true} {34377#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:22,814 INFO L290 TraceCheckUtils]: 157: Hoare triple {34377#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:22,814 INFO L290 TraceCheckUtils]: 158: Hoare triple {34377#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34382#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:46:22,815 INFO L290 TraceCheckUtils]: 159: Hoare triple {34382#(<= 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); {34286#false} is VALID [2022-04-15 12:46:22,815 INFO L272 TraceCheckUtils]: 160: Hoare triple {34286#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34286#false} is VALID [2022-04-15 12:46:22,815 INFO L290 TraceCheckUtils]: 161: Hoare triple {34286#false} ~cond := #in~cond; {34286#false} is VALID [2022-04-15 12:46:22,815 INFO L290 TraceCheckUtils]: 162: Hoare triple {34286#false} assume 0 == ~cond; {34286#false} is VALID [2022-04-15 12:46:22,815 INFO L290 TraceCheckUtils]: 163: Hoare triple {34286#false} assume !false; {34286#false} is VALID [2022-04-15 12:46:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 423 proven. 282 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 12:46:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316839976] [2022-04-15 12:46:22,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316839976] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778072334] [2022-04-15 12:46:22,816 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:22,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:22,817 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:22,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 12:46:23,176 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:23,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:23,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 12:46:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:23,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:24,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {34285#true} call ULTIMATE.init(); {34285#true} is VALID [2022-04-15 12:46:24,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#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); {34285#true} is VALID [2022-04-15 12:46:24,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34285#true} #70#return; {34285#true} is VALID [2022-04-15 12:46:24,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {34285#true} call #t~ret6 := main(); {34285#true} is VALID [2022-04-15 12:46:24,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {34285#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {34285#true} is VALID [2022-04-15 12:46:24,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {34285#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; {34405#(<= main_~i~0 0)} is VALID [2022-04-15 12:46:24,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {34405#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34405#(<= main_~i~0 0)} is VALID [2022-04-15 12:46:24,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {34405#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34291#(<= main_~i~0 1)} is VALID [2022-04-15 12:46:24,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {34291#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34291#(<= main_~i~0 1)} is VALID [2022-04-15 12:46:24,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {34291#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34292#(<= main_~i~0 2)} is VALID [2022-04-15 12:46:24,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {34292#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34292#(<= main_~i~0 2)} is VALID [2022-04-15 12:46:24,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {34292#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34293#(<= main_~i~0 3)} is VALID [2022-04-15 12:46:24,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {34293#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34293#(<= main_~i~0 3)} is VALID [2022-04-15 12:46:24,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {34293#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34294#(<= main_~i~0 4)} is VALID [2022-04-15 12:46:24,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {34294#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34294#(<= main_~i~0 4)} is VALID [2022-04-15 12:46:24,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {34294#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34295#(<= main_~i~0 5)} is VALID [2022-04-15 12:46:24,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {34295#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34295#(<= main_~i~0 5)} is VALID [2022-04-15 12:46:24,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {34295#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34296#(<= main_~i~0 6)} is VALID [2022-04-15 12:46:24,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {34296#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34296#(<= main_~i~0 6)} is VALID [2022-04-15 12:46:24,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {34296#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34297#(<= main_~i~0 7)} is VALID [2022-04-15 12:46:24,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {34297#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34297#(<= main_~i~0 7)} is VALID [2022-04-15 12:46:24,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {34297#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34298#(<= main_~i~0 8)} is VALID [2022-04-15 12:46:24,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {34298#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34298#(<= main_~i~0 8)} is VALID [2022-04-15 12:46:24,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {34298#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34299#(<= main_~i~0 9)} is VALID [2022-04-15 12:46:24,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {34299#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34299#(<= main_~i~0 9)} is VALID [2022-04-15 12:46:24,263 INFO L290 TraceCheckUtils]: 26: Hoare triple {34299#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34300#(<= main_~i~0 10)} is VALID [2022-04-15 12:46:24,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {34300#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34300#(<= main_~i~0 10)} is VALID [2022-04-15 12:46:24,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {34300#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34301#(<= main_~i~0 11)} is VALID [2022-04-15 12:46:24,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {34301#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34301#(<= main_~i~0 11)} is VALID [2022-04-15 12:46:24,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {34301#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34302#(<= main_~i~0 12)} is VALID [2022-04-15 12:46:24,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {34302#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34302#(<= main_~i~0 12)} is VALID [2022-04-15 12:46:24,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {34302#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34303#(<= main_~i~0 13)} is VALID [2022-04-15 12:46:24,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {34303#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34303#(<= main_~i~0 13)} is VALID [2022-04-15 12:46:24,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {34303#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34304#(<= main_~i~0 14)} is VALID [2022-04-15 12:46:24,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {34304#(<= main_~i~0 14)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34304#(<= main_~i~0 14)} is VALID [2022-04-15 12:46:24,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {34304#(<= main_~i~0 14)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34305#(<= main_~i~0 15)} is VALID [2022-04-15 12:46:24,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {34305#(<= main_~i~0 15)} assume !(~i~0 < ~n~0); {34306#(<= main_~n~0 15)} is VALID [2022-04-15 12:46:24,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {34306#(<= main_~n~0 15)} ~i~1 := 0; {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} is VALID [2022-04-15 12:46:24,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} is VALID [2022-04-15 12:46:24,266 INFO L272 TraceCheckUtils]: 40: Hoare triple {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,267 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {34285#true} {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} #68#return; {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} is VALID [2022-04-15 12:46:24,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} havoc #t~mem5; {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} is VALID [2022-04-15 12:46:24,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {34502#(and (<= main_~n~0 15) (<= 0 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} is VALID [2022-04-15 12:46:24,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} is VALID [2022-04-15 12:46:24,268 INFO L272 TraceCheckUtils]: 48: Hoare triple {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,268 INFO L290 TraceCheckUtils]: 50: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,268 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34285#true} {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} #68#return; {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} is VALID [2022-04-15 12:46:24,269 INFO L290 TraceCheckUtils]: 53: Hoare triple {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} havoc #t~mem5; {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} is VALID [2022-04-15 12:46:24,269 INFO L290 TraceCheckUtils]: 54: Hoare triple {34527#(and (<= main_~n~0 15) (<= 1 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} is VALID [2022-04-15 12:46:24,269 INFO L290 TraceCheckUtils]: 55: Hoare triple {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} is VALID [2022-04-15 12:46:24,269 INFO L272 TraceCheckUtils]: 56: Hoare triple {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,269 INFO L290 TraceCheckUtils]: 57: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,269 INFO L290 TraceCheckUtils]: 58: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,269 INFO L290 TraceCheckUtils]: 59: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,270 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {34285#true} {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} #68#return; {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} is VALID [2022-04-15 12:46:24,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} havoc #t~mem5; {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} is VALID [2022-04-15 12:46:24,270 INFO L290 TraceCheckUtils]: 62: Hoare triple {34552#(and (<= main_~n~0 15) (<= 2 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} is VALID [2022-04-15 12:46:24,271 INFO L290 TraceCheckUtils]: 63: Hoare triple {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} is VALID [2022-04-15 12:46:24,271 INFO L272 TraceCheckUtils]: 64: Hoare triple {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,271 INFO L290 TraceCheckUtils]: 67: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,271 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {34285#true} {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} #68#return; {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} is VALID [2022-04-15 12:46:24,271 INFO L290 TraceCheckUtils]: 69: Hoare triple {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} havoc #t~mem5; {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} is VALID [2022-04-15 12:46:24,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {34577#(and (<= main_~n~0 15) (<= 3 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} is VALID [2022-04-15 12:46:24,272 INFO L290 TraceCheckUtils]: 71: Hoare triple {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} is VALID [2022-04-15 12:46:24,272 INFO L272 TraceCheckUtils]: 72: Hoare triple {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,272 INFO L290 TraceCheckUtils]: 73: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,272 INFO L290 TraceCheckUtils]: 74: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,272 INFO L290 TraceCheckUtils]: 75: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,272 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {34285#true} {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} #68#return; {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} is VALID [2022-04-15 12:46:24,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} havoc #t~mem5; {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} is VALID [2022-04-15 12:46:24,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {34602#(and (<= main_~n~0 15) (<= 4 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} is VALID [2022-04-15 12:46:24,273 INFO L290 TraceCheckUtils]: 79: Hoare triple {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} is VALID [2022-04-15 12:46:24,273 INFO L272 TraceCheckUtils]: 80: Hoare triple {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,273 INFO L290 TraceCheckUtils]: 81: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,273 INFO L290 TraceCheckUtils]: 82: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,274 INFO L290 TraceCheckUtils]: 83: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,274 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {34285#true} {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} #68#return; {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} is VALID [2022-04-15 12:46:24,274 INFO L290 TraceCheckUtils]: 85: Hoare triple {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} havoc #t~mem5; {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} is VALID [2022-04-15 12:46:24,274 INFO L290 TraceCheckUtils]: 86: Hoare triple {34627#(and (<= main_~n~0 15) (<= 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,275 INFO L290 TraceCheckUtils]: 87: Hoare triple {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,275 INFO L272 TraceCheckUtils]: 88: Hoare triple {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,275 INFO L290 TraceCheckUtils]: 90: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,275 INFO L290 TraceCheckUtils]: 91: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,275 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {34285#true} {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} #68#return; {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,275 INFO L290 TraceCheckUtils]: 93: Hoare triple {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} havoc #t~mem5; {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,276 INFO L290 TraceCheckUtils]: 94: Hoare triple {34652#(and (<= 6 main_~i~1) (<= main_~n~0 15))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} is VALID [2022-04-15 12:46:24,276 INFO L290 TraceCheckUtils]: 95: Hoare triple {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} is VALID [2022-04-15 12:46:24,276 INFO L272 TraceCheckUtils]: 96: Hoare triple {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,276 INFO L290 TraceCheckUtils]: 97: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,276 INFO L290 TraceCheckUtils]: 98: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,276 INFO L290 TraceCheckUtils]: 99: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,277 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {34285#true} {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} #68#return; {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} is VALID [2022-04-15 12:46:24,277 INFO L290 TraceCheckUtils]: 101: Hoare triple {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} havoc #t~mem5; {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} is VALID [2022-04-15 12:46:24,277 INFO L290 TraceCheckUtils]: 102: Hoare triple {34677#(and (<= main_~n~0 15) (<= 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} is VALID [2022-04-15 12:46:24,277 INFO L290 TraceCheckUtils]: 103: Hoare triple {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} is VALID [2022-04-15 12:46:24,277 INFO L272 TraceCheckUtils]: 104: Hoare triple {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,278 INFO L290 TraceCheckUtils]: 105: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,278 INFO L290 TraceCheckUtils]: 106: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,278 INFO L290 TraceCheckUtils]: 107: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,278 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34285#true} {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} #68#return; {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} is VALID [2022-04-15 12:46:24,278 INFO L290 TraceCheckUtils]: 109: Hoare triple {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} havoc #t~mem5; {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} is VALID [2022-04-15 12:46:24,278 INFO L290 TraceCheckUtils]: 110: Hoare triple {34702#(and (<= main_~n~0 15) (<= 8 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} is VALID [2022-04-15 12:46:24,279 INFO L290 TraceCheckUtils]: 111: Hoare triple {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} is VALID [2022-04-15 12:46:24,279 INFO L272 TraceCheckUtils]: 112: Hoare triple {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,279 INFO L290 TraceCheckUtils]: 113: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,279 INFO L290 TraceCheckUtils]: 114: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,279 INFO L290 TraceCheckUtils]: 115: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,279 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {34285#true} {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} #68#return; {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} is VALID [2022-04-15 12:46:24,280 INFO L290 TraceCheckUtils]: 117: Hoare triple {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} havoc #t~mem5; {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} is VALID [2022-04-15 12:46:24,280 INFO L290 TraceCheckUtils]: 118: Hoare triple {34727#(and (<= main_~n~0 15) (<= 9 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,280 INFO L290 TraceCheckUtils]: 119: Hoare triple {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,280 INFO L272 TraceCheckUtils]: 120: Hoare triple {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,280 INFO L290 TraceCheckUtils]: 121: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,280 INFO L290 TraceCheckUtils]: 122: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,280 INFO L290 TraceCheckUtils]: 123: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,281 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {34285#true} {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} #68#return; {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,281 INFO L290 TraceCheckUtils]: 125: Hoare triple {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} havoc #t~mem5; {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,281 INFO L290 TraceCheckUtils]: 126: Hoare triple {34752#(and (<= 10 main_~i~1) (<= main_~n~0 15))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,281 INFO L290 TraceCheckUtils]: 127: Hoare triple {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,282 INFO L272 TraceCheckUtils]: 128: Hoare triple {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,282 INFO L290 TraceCheckUtils]: 129: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,282 INFO L290 TraceCheckUtils]: 130: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,282 INFO L290 TraceCheckUtils]: 131: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,282 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {34285#true} {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} #68#return; {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,282 INFO L290 TraceCheckUtils]: 133: Hoare triple {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} havoc #t~mem5; {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} is VALID [2022-04-15 12:46:24,283 INFO L290 TraceCheckUtils]: 134: Hoare triple {34777#(and (<= 11 main_~i~1) (<= main_~n~0 15))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} is VALID [2022-04-15 12:46:24,283 INFO L290 TraceCheckUtils]: 135: Hoare triple {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} is VALID [2022-04-15 12:46:24,283 INFO L272 TraceCheckUtils]: 136: Hoare triple {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,283 INFO L290 TraceCheckUtils]: 137: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,283 INFO L290 TraceCheckUtils]: 138: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,283 INFO L290 TraceCheckUtils]: 139: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,283 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {34285#true} {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} #68#return; {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} is VALID [2022-04-15 12:46:24,284 INFO L290 TraceCheckUtils]: 141: Hoare triple {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} havoc #t~mem5; {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} is VALID [2022-04-15 12:46:24,284 INFO L290 TraceCheckUtils]: 142: Hoare triple {34802#(and (<= main_~n~0 15) (<= 12 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} is VALID [2022-04-15 12:46:24,284 INFO L290 TraceCheckUtils]: 143: Hoare triple {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} is VALID [2022-04-15 12:46:24,284 INFO L272 TraceCheckUtils]: 144: Hoare triple {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,284 INFO L290 TraceCheckUtils]: 145: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,284 INFO L290 TraceCheckUtils]: 146: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,285 INFO L290 TraceCheckUtils]: 147: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,285 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {34285#true} {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} #68#return; {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} is VALID [2022-04-15 12:46:24,285 INFO L290 TraceCheckUtils]: 149: Hoare triple {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} havoc #t~mem5; {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} is VALID [2022-04-15 12:46:24,285 INFO L290 TraceCheckUtils]: 150: Hoare triple {34827#(and (<= main_~n~0 15) (<= 13 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} is VALID [2022-04-15 12:46:24,286 INFO L290 TraceCheckUtils]: 151: Hoare triple {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} is VALID [2022-04-15 12:46:24,286 INFO L272 TraceCheckUtils]: 152: Hoare triple {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,286 INFO L290 TraceCheckUtils]: 153: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,286 INFO L290 TraceCheckUtils]: 154: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,286 INFO L290 TraceCheckUtils]: 155: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,286 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {34285#true} {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} #68#return; {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} is VALID [2022-04-15 12:46:24,286 INFO L290 TraceCheckUtils]: 157: Hoare triple {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} havoc #t~mem5; {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} is VALID [2022-04-15 12:46:24,287 INFO L290 TraceCheckUtils]: 158: Hoare triple {34852#(and (<= main_~n~0 15) (<= 14 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34877#(and (<= main_~n~0 15) (<= 15 main_~i~1))} is VALID [2022-04-15 12:46:24,287 INFO L290 TraceCheckUtils]: 159: Hoare triple {34877#(and (<= main_~n~0 15) (<= 15 main_~i~1))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {34286#false} is VALID [2022-04-15 12:46:24,287 INFO L272 TraceCheckUtils]: 160: Hoare triple {34286#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34286#false} is VALID [2022-04-15 12:46:24,287 INFO L290 TraceCheckUtils]: 161: Hoare triple {34286#false} ~cond := #in~cond; {34286#false} is VALID [2022-04-15 12:46:24,287 INFO L290 TraceCheckUtils]: 162: Hoare triple {34286#false} assume 0 == ~cond; {34286#false} is VALID [2022-04-15 12:46:24,287 INFO L290 TraceCheckUtils]: 163: Hoare triple {34286#false} assume !false; {34286#false} is VALID [2022-04-15 12:46:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 480 proven. 225 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 12:46:24,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:24,711 INFO L290 TraceCheckUtils]: 163: Hoare triple {34286#false} assume !false; {34286#false} is VALID [2022-04-15 12:46:24,711 INFO L290 TraceCheckUtils]: 162: Hoare triple {34286#false} assume 0 == ~cond; {34286#false} is VALID [2022-04-15 12:46:24,711 INFO L290 TraceCheckUtils]: 161: Hoare triple {34286#false} ~cond := #in~cond; {34286#false} is VALID [2022-04-15 12:46:24,711 INFO L272 TraceCheckUtils]: 160: Hoare triple {34286#false} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34286#false} is VALID [2022-04-15 12:46:24,711 INFO L290 TraceCheckUtils]: 159: Hoare triple {34382#(<= 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); {34286#false} is VALID [2022-04-15 12:46:24,712 INFO L290 TraceCheckUtils]: 158: Hoare triple {34377#(<= main_~n~0 (+ main_~i~1 1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34382#(<= main_~n~0 main_~i~1)} is VALID [2022-04-15 12:46:24,712 INFO L290 TraceCheckUtils]: 157: Hoare triple {34377#(<= main_~n~0 (+ main_~i~1 1))} havoc #t~mem5; {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:24,712 INFO L284 TraceCheckUtils]: 156: Hoare quadruple {34285#true} {34377#(<= main_~n~0 (+ main_~i~1 1))} #68#return; {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:24,712 INFO L290 TraceCheckUtils]: 155: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,712 INFO L290 TraceCheckUtils]: 154: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,712 INFO L290 TraceCheckUtils]: 153: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,712 INFO L272 TraceCheckUtils]: 152: Hoare triple {34377#(<= main_~n~0 (+ main_~i~1 1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,713 INFO L290 TraceCheckUtils]: 151: Hoare triple {34377#(<= 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); {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:24,713 INFO L290 TraceCheckUtils]: 150: Hoare triple {34372#(<= main_~n~0 (+ main_~i~1 2))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34377#(<= main_~n~0 (+ main_~i~1 1))} is VALID [2022-04-15 12:46:24,713 INFO L290 TraceCheckUtils]: 149: Hoare triple {34372#(<= main_~n~0 (+ main_~i~1 2))} havoc #t~mem5; {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:24,713 INFO L284 TraceCheckUtils]: 148: Hoare quadruple {34285#true} {34372#(<= main_~n~0 (+ main_~i~1 2))} #68#return; {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:24,714 INFO L290 TraceCheckUtils]: 147: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,714 INFO L290 TraceCheckUtils]: 146: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,714 INFO L290 TraceCheckUtils]: 145: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,714 INFO L272 TraceCheckUtils]: 144: Hoare triple {34372#(<= main_~n~0 (+ main_~i~1 2))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,714 INFO L290 TraceCheckUtils]: 143: Hoare triple {34372#(<= 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); {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:24,714 INFO L290 TraceCheckUtils]: 142: Hoare triple {34367#(<= main_~n~0 (+ main_~i~1 3))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34372#(<= main_~n~0 (+ main_~i~1 2))} is VALID [2022-04-15 12:46:24,715 INFO L290 TraceCheckUtils]: 141: Hoare triple {34367#(<= main_~n~0 (+ main_~i~1 3))} havoc #t~mem5; {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:24,715 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {34285#true} {34367#(<= main_~n~0 (+ main_~i~1 3))} #68#return; {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:24,715 INFO L290 TraceCheckUtils]: 139: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,715 INFO L290 TraceCheckUtils]: 138: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,715 INFO L290 TraceCheckUtils]: 137: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,715 INFO L272 TraceCheckUtils]: 136: Hoare triple {34367#(<= main_~n~0 (+ main_~i~1 3))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,715 INFO L290 TraceCheckUtils]: 135: Hoare triple {34367#(<= 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); {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:24,716 INFO L290 TraceCheckUtils]: 134: Hoare triple {34362#(<= main_~n~0 (+ main_~i~1 4))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34367#(<= main_~n~0 (+ main_~i~1 3))} is VALID [2022-04-15 12:46:24,716 INFO L290 TraceCheckUtils]: 133: Hoare triple {34362#(<= main_~n~0 (+ main_~i~1 4))} havoc #t~mem5; {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:24,716 INFO L284 TraceCheckUtils]: 132: Hoare quadruple {34285#true} {34362#(<= main_~n~0 (+ main_~i~1 4))} #68#return; {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:24,716 INFO L290 TraceCheckUtils]: 131: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,716 INFO L290 TraceCheckUtils]: 130: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,716 INFO L290 TraceCheckUtils]: 129: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,716 INFO L272 TraceCheckUtils]: 128: Hoare triple {34362#(<= main_~n~0 (+ main_~i~1 4))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,717 INFO L290 TraceCheckUtils]: 127: Hoare triple {34362#(<= 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); {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:24,717 INFO L290 TraceCheckUtils]: 126: Hoare triple {34357#(<= main_~n~0 (+ 5 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34362#(<= main_~n~0 (+ main_~i~1 4))} is VALID [2022-04-15 12:46:24,717 INFO L290 TraceCheckUtils]: 125: Hoare triple {34357#(<= main_~n~0 (+ 5 main_~i~1))} havoc #t~mem5; {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:24,717 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {34285#true} {34357#(<= main_~n~0 (+ 5 main_~i~1))} #68#return; {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:24,717 INFO L290 TraceCheckUtils]: 123: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,717 INFO L290 TraceCheckUtils]: 122: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,718 INFO L290 TraceCheckUtils]: 121: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,718 INFO L272 TraceCheckUtils]: 120: Hoare triple {34357#(<= main_~n~0 (+ 5 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,718 INFO L290 TraceCheckUtils]: 119: Hoare triple {34357#(<= 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); {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:24,718 INFO L290 TraceCheckUtils]: 118: Hoare triple {34352#(<= main_~n~0 (+ main_~i~1 6))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34357#(<= main_~n~0 (+ 5 main_~i~1))} is VALID [2022-04-15 12:46:24,718 INFO L290 TraceCheckUtils]: 117: Hoare triple {34352#(<= main_~n~0 (+ main_~i~1 6))} havoc #t~mem5; {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:24,719 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {34285#true} {34352#(<= main_~n~0 (+ main_~i~1 6))} #68#return; {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:24,719 INFO L290 TraceCheckUtils]: 115: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,719 INFO L290 TraceCheckUtils]: 114: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,719 INFO L290 TraceCheckUtils]: 113: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,719 INFO L272 TraceCheckUtils]: 112: Hoare triple {34352#(<= main_~n~0 (+ main_~i~1 6))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,719 INFO L290 TraceCheckUtils]: 111: Hoare triple {34352#(<= 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); {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:24,719 INFO L290 TraceCheckUtils]: 110: Hoare triple {34347#(<= main_~n~0 (+ 7 main_~i~1))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34352#(<= main_~n~0 (+ main_~i~1 6))} is VALID [2022-04-15 12:46:24,720 INFO L290 TraceCheckUtils]: 109: Hoare triple {34347#(<= main_~n~0 (+ 7 main_~i~1))} havoc #t~mem5; {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:24,720 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34285#true} {34347#(<= main_~n~0 (+ 7 main_~i~1))} #68#return; {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:24,720 INFO L290 TraceCheckUtils]: 107: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,720 INFO L290 TraceCheckUtils]: 106: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,720 INFO L290 TraceCheckUtils]: 105: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,720 INFO L272 TraceCheckUtils]: 104: Hoare triple {34347#(<= main_~n~0 (+ 7 main_~i~1))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,720 INFO L290 TraceCheckUtils]: 103: Hoare triple {34347#(<= 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); {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:24,721 INFO L290 TraceCheckUtils]: 102: Hoare triple {34342#(<= main_~n~0 (+ main_~i~1 8))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34347#(<= main_~n~0 (+ 7 main_~i~1))} is VALID [2022-04-15 12:46:24,721 INFO L290 TraceCheckUtils]: 101: Hoare triple {34342#(<= main_~n~0 (+ main_~i~1 8))} havoc #t~mem5; {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:24,721 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {34285#true} {34342#(<= main_~n~0 (+ main_~i~1 8))} #68#return; {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:24,721 INFO L290 TraceCheckUtils]: 99: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,721 INFO L290 TraceCheckUtils]: 98: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,721 INFO L290 TraceCheckUtils]: 97: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,721 INFO L272 TraceCheckUtils]: 96: Hoare triple {34342#(<= main_~n~0 (+ main_~i~1 8))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,722 INFO L290 TraceCheckUtils]: 95: Hoare triple {34342#(<= 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); {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:24,722 INFO L290 TraceCheckUtils]: 94: Hoare triple {34337#(<= main_~n~0 (+ main_~i~1 9))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34342#(<= main_~n~0 (+ main_~i~1 8))} is VALID [2022-04-15 12:46:24,722 INFO L290 TraceCheckUtils]: 93: Hoare triple {34337#(<= main_~n~0 (+ main_~i~1 9))} havoc #t~mem5; {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:24,722 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {34285#true} {34337#(<= main_~n~0 (+ main_~i~1 9))} #68#return; {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:24,722 INFO L290 TraceCheckUtils]: 91: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,723 INFO L290 TraceCheckUtils]: 90: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,723 INFO L290 TraceCheckUtils]: 89: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,723 INFO L272 TraceCheckUtils]: 88: Hoare triple {34337#(<= main_~n~0 (+ main_~i~1 9))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,723 INFO L290 TraceCheckUtils]: 87: Hoare triple {34337#(<= 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); {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:24,723 INFO L290 TraceCheckUtils]: 86: Hoare triple {34332#(<= main_~n~0 (+ main_~i~1 10))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34337#(<= main_~n~0 (+ main_~i~1 9))} is VALID [2022-04-15 12:46:24,723 INFO L290 TraceCheckUtils]: 85: Hoare triple {34332#(<= main_~n~0 (+ main_~i~1 10))} havoc #t~mem5; {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:24,724 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {34285#true} {34332#(<= main_~n~0 (+ main_~i~1 10))} #68#return; {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:24,724 INFO L290 TraceCheckUtils]: 83: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,724 INFO L290 TraceCheckUtils]: 82: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,724 INFO L290 TraceCheckUtils]: 81: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,724 INFO L272 TraceCheckUtils]: 80: Hoare triple {34332#(<= main_~n~0 (+ main_~i~1 10))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,724 INFO L290 TraceCheckUtils]: 79: Hoare triple {34332#(<= 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); {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:24,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {34327#(<= main_~n~0 (+ main_~i~1 11))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34332#(<= main_~n~0 (+ main_~i~1 10))} is VALID [2022-04-15 12:46:24,725 INFO L290 TraceCheckUtils]: 77: Hoare triple {34327#(<= main_~n~0 (+ main_~i~1 11))} havoc #t~mem5; {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:24,725 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {34285#true} {34327#(<= main_~n~0 (+ main_~i~1 11))} #68#return; {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:24,725 INFO L290 TraceCheckUtils]: 75: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,725 INFO L290 TraceCheckUtils]: 74: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,725 INFO L272 TraceCheckUtils]: 72: Hoare triple {34327#(<= main_~n~0 (+ main_~i~1 11))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {34327#(<= 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); {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:24,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {34322#(<= main_~n~0 (+ main_~i~1 12))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34327#(<= main_~n~0 (+ main_~i~1 11))} is VALID [2022-04-15 12:46:24,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {34322#(<= main_~n~0 (+ main_~i~1 12))} havoc #t~mem5; {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:24,726 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {34285#true} {34322#(<= main_~n~0 (+ main_~i~1 12))} #68#return; {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:24,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,726 INFO L272 TraceCheckUtils]: 64: Hoare triple {34322#(<= main_~n~0 (+ main_~i~1 12))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,727 INFO L290 TraceCheckUtils]: 63: Hoare triple {34322#(<= 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); {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:24,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {34317#(<= main_~n~0 (+ main_~i~1 13))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34322#(<= main_~n~0 (+ main_~i~1 12))} is VALID [2022-04-15 12:46:24,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {34317#(<= main_~n~0 (+ main_~i~1 13))} havoc #t~mem5; {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:24,727 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {34285#true} {34317#(<= main_~n~0 (+ main_~i~1 13))} #68#return; {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:24,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,728 INFO L272 TraceCheckUtils]: 56: Hoare triple {34317#(<= main_~n~0 (+ main_~i~1 13))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,728 INFO L290 TraceCheckUtils]: 55: Hoare triple {34317#(<= 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); {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:24,728 INFO L290 TraceCheckUtils]: 54: Hoare triple {34312#(<= main_~n~0 (+ main_~i~1 14))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34317#(<= main_~n~0 (+ main_~i~1 13))} is VALID [2022-04-15 12:46:24,729 INFO L290 TraceCheckUtils]: 53: Hoare triple {34312#(<= main_~n~0 (+ main_~i~1 14))} havoc #t~mem5; {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:24,729 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {34285#true} {34312#(<= main_~n~0 (+ main_~i~1 14))} #68#return; {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:24,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,729 INFO L290 TraceCheckUtils]: 49: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,729 INFO L272 TraceCheckUtils]: 48: Hoare triple {34312#(<= main_~n~0 (+ main_~i~1 14))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,729 INFO L290 TraceCheckUtils]: 47: Hoare triple {34312#(<= 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); {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:24,730 INFO L290 TraceCheckUtils]: 46: Hoare triple {35244#(<= main_~n~0 (+ main_~i~1 15))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {34312#(<= main_~n~0 (+ main_~i~1 14))} is VALID [2022-04-15 12:46:24,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {35244#(<= main_~n~0 (+ main_~i~1 15))} havoc #t~mem5; {35244#(<= main_~n~0 (+ main_~i~1 15))} is VALID [2022-04-15 12:46:24,730 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {34285#true} {35244#(<= main_~n~0 (+ main_~i~1 15))} #68#return; {35244#(<= main_~n~0 (+ main_~i~1 15))} is VALID [2022-04-15 12:46:24,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {34285#true} assume !(0 == ~cond); {34285#true} is VALID [2022-04-15 12:46:24,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {34285#true} ~cond := #in~cond; {34285#true} is VALID [2022-04-15 12:46:24,730 INFO L272 TraceCheckUtils]: 40: Hoare triple {35244#(<= main_~n~0 (+ main_~i~1 15))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {34285#true} is VALID [2022-04-15 12:46:24,731 INFO L290 TraceCheckUtils]: 39: Hoare triple {35244#(<= main_~n~0 (+ main_~i~1 15))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {35244#(<= main_~n~0 (+ main_~i~1 15))} is VALID [2022-04-15 12:46:24,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {34306#(<= main_~n~0 15)} ~i~1 := 0; {35244#(<= main_~n~0 (+ main_~i~1 15))} is VALID [2022-04-15 12:46:24,731 INFO L290 TraceCheckUtils]: 37: Hoare triple {34305#(<= main_~i~0 15)} assume !(~i~0 < ~n~0); {34306#(<= main_~n~0 15)} is VALID [2022-04-15 12:46:24,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {34304#(<= main_~i~0 14)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34305#(<= main_~i~0 15)} is VALID [2022-04-15 12:46:24,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {34304#(<= main_~i~0 14)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34304#(<= main_~i~0 14)} is VALID [2022-04-15 12:46:24,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {34303#(<= main_~i~0 13)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34304#(<= main_~i~0 14)} is VALID [2022-04-15 12:46:24,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {34303#(<= main_~i~0 13)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34303#(<= main_~i~0 13)} is VALID [2022-04-15 12:46:24,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {34302#(<= main_~i~0 12)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34303#(<= main_~i~0 13)} is VALID [2022-04-15 12:46:24,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {34302#(<= main_~i~0 12)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34302#(<= main_~i~0 12)} is VALID [2022-04-15 12:46:24,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {34301#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34302#(<= main_~i~0 12)} is VALID [2022-04-15 12:46:24,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {34301#(<= main_~i~0 11)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34301#(<= main_~i~0 11)} is VALID [2022-04-15 12:46:24,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {34300#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34301#(<= main_~i~0 11)} is VALID [2022-04-15 12:46:24,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {34300#(<= main_~i~0 10)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34300#(<= main_~i~0 10)} is VALID [2022-04-15 12:46:24,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {34299#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34300#(<= main_~i~0 10)} is VALID [2022-04-15 12:46:24,734 INFO L290 TraceCheckUtils]: 25: Hoare triple {34299#(<= main_~i~0 9)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34299#(<= main_~i~0 9)} is VALID [2022-04-15 12:46:24,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {34298#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34299#(<= main_~i~0 9)} is VALID [2022-04-15 12:46:24,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {34298#(<= main_~i~0 8)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34298#(<= main_~i~0 8)} is VALID [2022-04-15 12:46:24,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {34297#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34298#(<= main_~i~0 8)} is VALID [2022-04-15 12:46:24,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {34297#(<= main_~i~0 7)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34297#(<= main_~i~0 7)} is VALID [2022-04-15 12:46:24,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {34296#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34297#(<= main_~i~0 7)} is VALID [2022-04-15 12:46:24,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {34296#(<= main_~i~0 6)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34296#(<= main_~i~0 6)} is VALID [2022-04-15 12:46:24,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {34295#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34296#(<= main_~i~0 6)} is VALID [2022-04-15 12:46:24,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {34295#(<= main_~i~0 5)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34295#(<= main_~i~0 5)} is VALID [2022-04-15 12:46:24,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {34294#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34295#(<= main_~i~0 5)} is VALID [2022-04-15 12:46:24,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {34294#(<= main_~i~0 4)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34294#(<= main_~i~0 4)} is VALID [2022-04-15 12:46:24,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {34293#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34294#(<= main_~i~0 4)} is VALID [2022-04-15 12:46:24,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {34293#(<= main_~i~0 3)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34293#(<= main_~i~0 3)} is VALID [2022-04-15 12:46:24,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {34292#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34293#(<= main_~i~0 3)} is VALID [2022-04-15 12:46:24,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {34292#(<= main_~i~0 2)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34292#(<= main_~i~0 2)} is VALID [2022-04-15 12:46:24,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {34291#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34292#(<= main_~i~0 2)} is VALID [2022-04-15 12:46:24,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {34291#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34291#(<= main_~i~0 1)} is VALID [2022-04-15 12:46:24,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {34405#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34291#(<= main_~i~0 1)} is VALID [2022-04-15 12:46:24,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {34405#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {34405#(<= main_~i~0 0)} is VALID [2022-04-15 12:46:24,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {34285#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; {34405#(<= main_~i~0 0)} is VALID [2022-04-15 12:46:24,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {34285#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {34285#true} is VALID [2022-04-15 12:46:24,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {34285#true} call #t~ret6 := main(); {34285#true} is VALID [2022-04-15 12:46:24,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34285#true} {34285#true} #70#return; {34285#true} is VALID [2022-04-15 12:46:24,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {34285#true} assume true; {34285#true} is VALID [2022-04-15 12:46:24,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {34285#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); {34285#true} is VALID [2022-04-15 12:46:24,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {34285#true} call ULTIMATE.init(); {34285#true} is VALID [2022-04-15 12:46:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 480 proven. 225 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 12:46:24,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778072334] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:24,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:24,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 54 [2022-04-15 12:46:24,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:24,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2022950930] [2022-04-15 12:46:24,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2022950930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:24,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:24,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:46:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845703487] [2022-04-15 12:46:24,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 35 states have internal predecessors, (88), 17 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 164 [2022-04-15 12:46:24,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:24,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 35 states have internal predecessors, (88), 17 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:46:24,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:24,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:46:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:46:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=2226, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:46:24,797 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 35 states have internal predecessors, (88), 17 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:46:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:26,215 INFO L93 Difference]: Finished difference Result 242 states and 259 transitions. [2022-04-15 12:46:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:46:26,216 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 35 states have internal predecessors, (88), 17 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 164 [2022-04-15 12:46:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 35 states have internal predecessors, (88), 17 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:46:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 141 transitions. [2022-04-15 12:46:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 35 states have internal predecessors, (88), 17 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:46:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 141 transitions. [2022-04-15 12:46:26,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 141 transitions. [2022-04-15 12:46:26,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:26,334 INFO L225 Difference]: With dead ends: 242 [2022-04-15 12:46:26,334 INFO L226 Difference]: Without dead ends: 170 [2022-04-15 12:46:26,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 341 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1302, Invalid=6180, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:46:26,335 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 62 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:26,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 90 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:46:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-15 12:46:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2022-04-15 12:46:26,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:26,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 169 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 12:46:26,519 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 169 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 12:46:26,519 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 169 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 12:46:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:26,528 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2022-04-15 12:46:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2022-04-15 12:46:26,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:26,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:26,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 170 states. [2022-04-15 12:46:26,529 INFO L87 Difference]: Start difference. First operand has 169 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 170 states. [2022-04-15 12:46:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:26,531 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2022-04-15 12:46:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2022-04-15 12:46:26,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:26,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:26,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:26,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.0150375939849625) internal successors, (135), 134 states have internal predecessors, (135), 18 states have call successors, (18), 18 states have call predecessors, (18), 17 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 12:46:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2022-04-15 12:46:26,533 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2022-04-15 12:46:26,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:26,533 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2022-04-15 12:46:26,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 35 states have internal predecessors, (88), 17 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 12:46:26,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 170 transitions. [2022-04-15 12:46:26,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2022-04-15 12:46:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-04-15 12:46:26,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:26,817 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:26,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:27,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-15 12:46:27,018 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -817141580, now seen corresponding path program 59 times [2022-04-15 12:46:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564348357] [2022-04-15 12:46:27,020 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:46:27,020 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:46:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash -817141580, now seen corresponding path program 60 times [2022-04-15 12:46:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:27,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539509137] [2022-04-15 12:46:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {36715#(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); {36613#true} is VALID [2022-04-15 12:46:27,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36613#true} {36613#true} #70#return; {36613#true} is VALID [2022-04-15 12:46:27,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-15 12:46:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} #68#return; {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} is VALID [2022-04-15 12:46:27,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-15 12:46:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} #68#return; {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 12:46:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #68#return; {36646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-15 12:46:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36651#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {36651#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 12:46:27,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-15 12:46:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36656#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {36656#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-04-15 12:46:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36661#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {36661#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-04-15 12:46:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36666#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {36666#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:46:27,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-04-15 12:46:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36671#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {36671#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-04-15 12:46:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36676#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {36676#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:46:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-04-15 12:46:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {36681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:46:27,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-04-15 12:46:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {36686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:46:27,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-04-15 12:46:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {36691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-04-15 12:46:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36696#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {36696#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:46:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-04-15 12:46:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36701#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {36701#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:46:27,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-04-15 12:46:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:27,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {36706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:46:27,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {36613#true} call ULTIMATE.init(); {36715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:27,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {36715#(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); {36613#true} is VALID [2022-04-15 12:46:27,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36613#true} {36613#true} #70#return; {36613#true} is VALID [2022-04-15 12:46:27,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {36613#true} call #t~ret6 := main(); {36613#true} is VALID [2022-04-15 12:46:27,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {36613#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {36613#true} is VALID [2022-04-15 12:46:27,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {36613#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; {36618#(= main_~i~0 0)} is VALID [2022-04-15 12:46:27,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {36618#(= main_~i~0 0)} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {36618#(= main_~i~0 0)} is VALID [2022-04-15 12:46:27,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {36618#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36619#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:46:27,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {36619#(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); {36619#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2022-04-15 12:46:27,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {36619#(and (<= main_~i~0 1) (<= 1 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36620#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:46:27,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {36620#(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); {36620#(and (<= 2 main_~i~0) (<= main_~i~0 2))} is VALID [2022-04-15 12:46:27,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {36620#(and (<= 2 main_~i~0) (<= main_~i~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36621#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:46:27,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {36621#(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); {36621#(and (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-15 12:46:27,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {36621#(and (<= 3 main_~i~0) (<= main_~i~0 3))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36622#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:46:27,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {36622#(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); {36622#(and (<= main_~i~0 4) (<= 4 main_~i~0))} is VALID [2022-04-15 12:46:27,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {36622#(and (<= main_~i~0 4) (<= 4 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36623#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:46:27,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {36623#(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); {36623#(and (<= main_~i~0 5) (<= 5 main_~i~0))} is VALID [2022-04-15 12:46:27,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {36623#(and (<= main_~i~0 5) (<= 5 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36624#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:46:27,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {36624#(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); {36624#(and (<= main_~i~0 6) (<= 6 main_~i~0))} is VALID [2022-04-15 12:46:27,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {36624#(and (<= main_~i~0 6) (<= 6 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36625#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:46:27,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {36625#(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); {36625#(and (<= main_~i~0 7) (<= 7 main_~i~0))} is VALID [2022-04-15 12:46:27,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {36625#(and (<= main_~i~0 7) (<= 7 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36626#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:46:27,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {36626#(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); {36626#(and (<= 8 main_~i~0) (<= main_~i~0 8))} is VALID [2022-04-15 12:46:27,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {36626#(and (<= 8 main_~i~0) (<= main_~i~0 8))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36627#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:46:27,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {36627#(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); {36627#(and (<= 9 main_~i~0) (<= main_~i~0 9))} is VALID [2022-04-15 12:46:27,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {36627#(and (<= 9 main_~i~0) (<= main_~i~0 9))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36628#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:46:27,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {36628#(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); {36628#(and (<= main_~i~0 10) (<= 10 main_~i~0))} is VALID [2022-04-15 12:46:27,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {36628#(and (<= main_~i~0 10) (<= 10 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36629#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:46:27,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {36629#(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); {36629#(and (<= 11 main_~i~0) (<= main_~i~0 11))} is VALID [2022-04-15 12:46:27,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {36629#(and (<= 11 main_~i~0) (<= main_~i~0 11))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36630#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:46:27,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {36630#(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); {36630#(and (<= 12 main_~i~0) (<= main_~i~0 12))} is VALID [2022-04-15 12:46:27,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {36630#(and (<= 12 main_~i~0) (<= main_~i~0 12))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36631#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:46:27,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {36631#(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); {36631#(and (<= main_~i~0 13) (<= 13 main_~i~0))} is VALID [2022-04-15 12:46:27,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {36631#(and (<= main_~i~0 13) (<= 13 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36632#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:46:27,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {36632#(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); {36632#(and (<= main_~i~0 14) (<= 14 main_~i~0))} is VALID [2022-04-15 12:46:27,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {36632#(and (<= main_~i~0 14) (<= 14 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36633#(and (<= 15 main_~i~0) (<= main_~i~0 15))} is VALID [2022-04-15 12:46:27,830 INFO L290 TraceCheckUtils]: 37: Hoare triple {36633#(and (<= 15 main_~i~0) (<= main_~i~0 15))} assume !!(~i~0 < ~n~0);call write~int(0, ~x~0.base, ~x~0.offset + 4 * ~i~0, 4); {36634#(and (<= 15 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 15))} is VALID [2022-04-15 12:46:27,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {36634#(and (<= 15 main_~i~0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~0 4))) 0) (<= main_~i~0 15))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36635#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0)} is VALID [2022-04-15 12:46:27,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {36635#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0)} assume !(~i~0 < ~n~0); {36635#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0)} is VALID [2022-04-15 12:46:27,831 INFO L290 TraceCheckUtils]: 40: Hoare triple {36635#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0)} ~i~1 := 0; {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} is VALID [2022-04-15 12:46:27,831 INFO L290 TraceCheckUtils]: 41: Hoare triple {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} assume !!(~i~1 < ~n~0);call #t~mem5 := read~int(~x~0.base, ~x~0.offset + 4 * ~i~1, 4); {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} is VALID [2022-04-15 12:46:27,831 INFO L272 TraceCheckUtils]: 42: Hoare triple {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {36613#true} is VALID [2022-04-15 12:46:27,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,832 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {36613#true} {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} #68#return; {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} is VALID [2022-04-15 12:46:27,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} havoc #t~mem5; {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} is VALID [2022-04-15 12:46:27,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {36636#(and (= main_~i~1 0) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 60)) 0))} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 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); {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,833 INFO L272 TraceCheckUtils]: 50: Hoare triple {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {36613#true} is VALID [2022-04-15 12:46:27,833 INFO L290 TraceCheckUtils]: 51: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,833 INFO L290 TraceCheckUtils]: 52: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,833 INFO L290 TraceCheckUtils]: 53: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,833 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {36613#true} {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} #68#return; {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} havoc #t~mem5; {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {36641#(= (select (select |#memory_int| main_~x~0.base) (+ 56 main_~x~0.offset (* main_~i~1 4))) 0)} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {36646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {36646#(= (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); {36646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,835 INFO L272 TraceCheckUtils]: 58: Hoare triple {36646#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,835 INFO L290 TraceCheckUtils]: 60: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,835 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {36613#true} {36646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} #68#return; {36646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {36646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} havoc #t~mem5; {36646#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 52 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {36646#(= (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; {36651#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 12:46:27,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {36651#(= (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); {36651#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 12:46:27,837 INFO L272 TraceCheckUtils]: 66: Hoare triple {36651#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,837 INFO L290 TraceCheckUtils]: 68: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,837 INFO L290 TraceCheckUtils]: 69: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,837 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {36613#true} {36651#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} #68#return; {36651#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 12:46:27,838 INFO L290 TraceCheckUtils]: 71: Hoare triple {36651#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} havoc #t~mem5; {36651#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 48)) 0)} is VALID [2022-04-15 12:46:27,838 INFO L290 TraceCheckUtils]: 72: Hoare triple {36651#(= (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; {36656#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,838 INFO L290 TraceCheckUtils]: 73: Hoare triple {36656#(= (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); {36656#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,838 INFO L272 TraceCheckUtils]: 74: Hoare triple {36656#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,839 INFO L290 TraceCheckUtils]: 75: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,839 INFO L290 TraceCheckUtils]: 76: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,839 INFO L290 TraceCheckUtils]: 77: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,839 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {36613#true} {36656#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} #68#return; {36656#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,839 INFO L290 TraceCheckUtils]: 79: Hoare triple {36656#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} havoc #t~mem5; {36656#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 44 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,840 INFO L290 TraceCheckUtils]: 80: Hoare triple {36656#(= (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; {36661#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,840 INFO L290 TraceCheckUtils]: 81: Hoare triple {36661#(= (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); {36661#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,840 INFO L272 TraceCheckUtils]: 82: Hoare triple {36661#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,840 INFO L290 TraceCheckUtils]: 83: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,840 INFO L290 TraceCheckUtils]: 84: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,841 INFO L290 TraceCheckUtils]: 85: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,841 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {36613#true} {36661#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} #68#return; {36661#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,841 INFO L290 TraceCheckUtils]: 87: Hoare triple {36661#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} havoc #t~mem5; {36661#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 40 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,842 INFO L290 TraceCheckUtils]: 88: Hoare triple {36661#(= (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; {36666#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:46:27,842 INFO L290 TraceCheckUtils]: 89: Hoare triple {36666#(= (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); {36666#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:46:27,842 INFO L272 TraceCheckUtils]: 90: Hoare triple {36666#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,842 INFO L290 TraceCheckUtils]: 91: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,842 INFO L290 TraceCheckUtils]: 92: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,842 INFO L290 TraceCheckUtils]: 93: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,843 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {36613#true} {36666#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} #68#return; {36666#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:46:27,843 INFO L290 TraceCheckUtils]: 95: Hoare triple {36666#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} havoc #t~mem5; {36666#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 36)) 0)} is VALID [2022-04-15 12:46:27,844 INFO L290 TraceCheckUtils]: 96: Hoare triple {36666#(= (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; {36671#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,844 INFO L290 TraceCheckUtils]: 97: Hoare triple {36671#(= (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); {36671#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,844 INFO L272 TraceCheckUtils]: 98: Hoare triple {36671#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,844 INFO L290 TraceCheckUtils]: 99: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,844 INFO L290 TraceCheckUtils]: 100: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,844 INFO L290 TraceCheckUtils]: 101: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,845 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {36613#true} {36671#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} #68#return; {36671#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,845 INFO L290 TraceCheckUtils]: 103: Hoare triple {36671#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} havoc #t~mem5; {36671#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 32 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,845 INFO L290 TraceCheckUtils]: 104: Hoare triple {36671#(= (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; {36676#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:46:27,846 INFO L290 TraceCheckUtils]: 105: Hoare triple {36676#(= (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); {36676#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:46:27,846 INFO L272 TraceCheckUtils]: 106: Hoare triple {36676#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,846 INFO L290 TraceCheckUtils]: 107: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,846 INFO L290 TraceCheckUtils]: 108: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,846 INFO L290 TraceCheckUtils]: 109: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,847 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {36613#true} {36676#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} #68#return; {36676#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:46:27,847 INFO L290 TraceCheckUtils]: 111: Hoare triple {36676#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} havoc #t~mem5; {36676#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 28)) 0)} is VALID [2022-04-15 12:46:27,847 INFO L290 TraceCheckUtils]: 112: Hoare triple {36676#(= (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; {36681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:46:27,848 INFO L290 TraceCheckUtils]: 113: Hoare triple {36681#(= (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); {36681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:46:27,848 INFO L272 TraceCheckUtils]: 114: Hoare triple {36681#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,848 INFO L290 TraceCheckUtils]: 115: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,848 INFO L290 TraceCheckUtils]: 116: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,848 INFO L290 TraceCheckUtils]: 117: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,848 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {36613#true} {36681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} #68#return; {36681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:46:27,849 INFO L290 TraceCheckUtils]: 119: Hoare triple {36681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} havoc #t~mem5; {36681#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 24)) 0)} is VALID [2022-04-15 12:46:27,849 INFO L290 TraceCheckUtils]: 120: Hoare triple {36681#(= (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; {36686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:46:27,849 INFO L290 TraceCheckUtils]: 121: Hoare triple {36686#(= (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); {36686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:46:27,849 INFO L272 TraceCheckUtils]: 122: Hoare triple {36686#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,849 INFO L290 TraceCheckUtils]: 123: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,850 INFO L290 TraceCheckUtils]: 124: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,850 INFO L290 TraceCheckUtils]: 125: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,850 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {36613#true} {36686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} #68#return; {36686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:46:27,850 INFO L290 TraceCheckUtils]: 127: Hoare triple {36686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} havoc #t~mem5; {36686#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 20)) 0)} is VALID [2022-04-15 12:46:27,851 INFO L290 TraceCheckUtils]: 128: Hoare triple {36686#(= (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; {36691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,851 INFO L290 TraceCheckUtils]: 129: Hoare triple {36691#(= (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); {36691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,851 INFO L272 TraceCheckUtils]: 130: Hoare triple {36691#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,851 INFO L290 TraceCheckUtils]: 131: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,851 INFO L290 TraceCheckUtils]: 132: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,851 INFO L290 TraceCheckUtils]: 133: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,852 INFO L284 TraceCheckUtils]: 134: Hoare quadruple {36613#true} {36691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} #68#return; {36691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,852 INFO L290 TraceCheckUtils]: 135: Hoare triple {36691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} havoc #t~mem5; {36691#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 16 (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,853 INFO L290 TraceCheckUtils]: 136: Hoare triple {36691#(= (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; {36696#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:46:27,853 INFO L290 TraceCheckUtils]: 137: Hoare triple {36696#(= (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); {36696#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:46:27,853 INFO L272 TraceCheckUtils]: 138: Hoare triple {36696#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,853 INFO L290 TraceCheckUtils]: 139: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,853 INFO L290 TraceCheckUtils]: 140: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,853 INFO L290 TraceCheckUtils]: 141: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,854 INFO L284 TraceCheckUtils]: 142: Hoare quadruple {36613#true} {36696#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} #68#return; {36696#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:46:27,854 INFO L290 TraceCheckUtils]: 143: Hoare triple {36696#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} havoc #t~mem5; {36696#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 12)) 0)} is VALID [2022-04-15 12:46:27,855 INFO L290 TraceCheckUtils]: 144: Hoare triple {36696#(= (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; {36701#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:46:27,855 INFO L290 TraceCheckUtils]: 145: Hoare triple {36701#(= 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); {36701#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:46:27,855 INFO L272 TraceCheckUtils]: 146: Hoare triple {36701#(= 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)); {36613#true} is VALID [2022-04-15 12:46:27,855 INFO L290 TraceCheckUtils]: 147: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,855 INFO L290 TraceCheckUtils]: 148: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,855 INFO L290 TraceCheckUtils]: 149: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,856 INFO L284 TraceCheckUtils]: 150: Hoare quadruple {36613#true} {36701#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} #68#return; {36701#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:46:27,856 INFO L290 TraceCheckUtils]: 151: Hoare triple {36701#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} havoc #t~mem5; {36701#(= 0 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 8)))} is VALID [2022-04-15 12:46:27,856 INFO L290 TraceCheckUtils]: 152: Hoare triple {36701#(= 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; {36706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:46:27,857 INFO L290 TraceCheckUtils]: 153: Hoare triple {36706#(= (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); {36706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:46:27,857 INFO L272 TraceCheckUtils]: 154: Hoare triple {36706#(= (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)); {36613#true} is VALID [2022-04-15 12:46:27,857 INFO L290 TraceCheckUtils]: 155: Hoare triple {36613#true} ~cond := #in~cond; {36613#true} is VALID [2022-04-15 12:46:27,857 INFO L290 TraceCheckUtils]: 156: Hoare triple {36613#true} assume !(0 == ~cond); {36613#true} is VALID [2022-04-15 12:46:27,857 INFO L290 TraceCheckUtils]: 157: Hoare triple {36613#true} assume true; {36613#true} is VALID [2022-04-15 12:46:27,857 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {36613#true} {36706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} #68#return; {36706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:46:27,858 INFO L290 TraceCheckUtils]: 159: Hoare triple {36706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} havoc #t~mem5; {36706#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4) 4)) 0)} is VALID [2022-04-15 12:46:27,858 INFO L290 TraceCheckUtils]: 160: Hoare triple {36706#(= (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; {36711#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset (* main_~i~1 4))) 0)} is VALID [2022-04-15 12:46:27,859 INFO L290 TraceCheckUtils]: 161: Hoare triple {36711#(= (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); {36712#(= |main_#t~mem5| 0)} is VALID [2022-04-15 12:46:27,859 INFO L272 TraceCheckUtils]: 162: Hoare triple {36712#(= |main_#t~mem5| 0)} call __VERIFIER_assert((if 0 == #t~mem5 then 1 else 0)); {36713#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:46:27,859 INFO L290 TraceCheckUtils]: 163: Hoare triple {36713#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {36714#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:27,860 INFO L290 TraceCheckUtils]: 164: Hoare triple {36714#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36614#false} is VALID [2022-04-15 12:46:27,860 INFO L290 TraceCheckUtils]: 165: Hoare triple {36614#false} assume !false; {36614#false} is VALID [2022-04-15 12:46:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 30 proven. 706 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 12:46:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539509137] [2022-04-15 12:46:27,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539509137] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094320225] [2022-04-15 12:46:27,861 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:27,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:27,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:27,863 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:27,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 12:46:28,161 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-04-15 12:46:28,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:28,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:46:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:28,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:28,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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