/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:39,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:39,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:39,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:39,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:39,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:39,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:39,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:39,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:39,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:39,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:39,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:39,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:39,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:39,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:39,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:39,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:39,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:39,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:39,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:39,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:39,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:39,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:39,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:39,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:39,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:39,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:39,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:39,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:39,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:39,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:39,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:39,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:39,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:39,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:39,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:39,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:39,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:39,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:39,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:39,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:39,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:14:39,096 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:39,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:39,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:39,097 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:39,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:39,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:39,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:39,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:39,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:39,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:39,100 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:39,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:39,100 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:39,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:39,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:39,101 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:39,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:39,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:39,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:39,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:39,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:39,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:39,103 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:39,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:39,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:39,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:39,424 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:39,425 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:39,425 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-18 00:14:39,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28590bf77/468227e750934854ab3709d4bbd85958/FLAG48f93ff3c [2020-07-18 00:14:39,897 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:39,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-18 00:14:39,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28590bf77/468227e750934854ab3709d4bbd85958/FLAG48f93ff3c [2020-07-18 00:14:40,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28590bf77/468227e750934854ab3709d4bbd85958 [2020-07-18 00:14:40,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:40,251 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:40,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:40,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:40,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:40,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2087db64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40, skipping insertion in model container [2020-07-18 00:14:40,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:40,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:40,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:40,508 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:40,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:40,553 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:40,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40 WrapperNode [2020-07-18 00:14:40,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:40,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:40,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:40,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:40,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:40,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:40,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:40,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:40,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:40,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:40,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:40,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:14:40,755 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:14:40,755 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-18 00:14:40,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:40,755 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-18 00:14:40,755 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:14:40,755 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:14:40,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:40,755 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:14:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:14:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:14:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-18 00:14:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:14:40,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:40,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:14:40,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-18 00:14:40,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:14:40,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:40,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:40,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:14:41,268 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:41,268 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:41,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:41 BoogieIcfgContainer [2020-07-18 00:14:41,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:41,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:41,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:41,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:41,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:14:40" (1/3) ... [2020-07-18 00:14:41,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558b67c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:41, skipping insertion in model container [2020-07-18 00:14:41,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (2/3) ... [2020-07-18 00:14:41,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558b67c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:41, skipping insertion in model container [2020-07-18 00:14:41,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:41" (3/3) ... [2020-07-18 00:14:41,282 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-18 00:14:41,292 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:41,300 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:41,315 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:41,336 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:41,337 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:41,337 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:41,337 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:41,337 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:41,337 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:41,338 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:41,338 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-18 00:14:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 00:14:41,366 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:41,366 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:41,367 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-07-18 00:14:41,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:41,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [868771600] [2020-07-18 00:14:41,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {90#true} is VALID [2020-07-18 00:14:41,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} #valid := #valid[0 := 0]; {90#true} is VALID [2020-07-18 00:14:41,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume 0 < #StackHeapBarrier; {90#true} is VALID [2020-07-18 00:14:41,797 INFO L280 TraceCheckUtils]: 3: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 00:14:41,797 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {90#true} {90#true} #117#return; {90#true} is VALID [2020-07-18 00:14:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-18 00:14:41,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-18 00:14:41,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 00:14:41,808 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #99#return; {90#true} is VALID [2020-07-18 00:14:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-18 00:14:41,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-18 00:14:41,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 00:14:41,816 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #101#return; {90#true} is VALID [2020-07-18 00:14:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {90#true} is VALID [2020-07-18 00:14:41,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 00:14:41,840 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #103#return; {90#true} is VALID [2020-07-18 00:14:41,842 INFO L263 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:14:41,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {90#true} is VALID [2020-07-18 00:14:41,843 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} #valid := #valid[0 := 0]; {90#true} is VALID [2020-07-18 00:14:41,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {90#true} assume 0 < #StackHeapBarrier; {90#true} is VALID [2020-07-18 00:14:41,844 INFO L280 TraceCheckUtils]: 4: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 00:14:41,844 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {90#true} {90#true} #117#return; {90#true} is VALID [2020-07-18 00:14:41,845 INFO L263 TraceCheckUtils]: 6: Hoare triple {90#true} call #t~ret14 := main(); {90#true} is VALID [2020-07-18 00:14:41,845 INFO L280 TraceCheckUtils]: 7: Hoare triple {90#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {90#true} is VALID [2020-07-18 00:14:41,846 INFO L280 TraceCheckUtils]: 8: Hoare triple {90#true} ~n~0 := #t~nondet8; {90#true} is VALID [2020-07-18 00:14:41,846 INFO L280 TraceCheckUtils]: 9: Hoare triple {90#true} havoc #t~nondet8; {90#true} is VALID [2020-07-18 00:14:41,846 INFO L263 TraceCheckUtils]: 10: Hoare triple {90#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {90#true} is VALID [2020-07-18 00:14:41,847 INFO L280 TraceCheckUtils]: 11: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-18 00:14:41,847 INFO L280 TraceCheckUtils]: 12: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-18 00:14:41,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 00:14:41,848 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {90#true} {90#true} #99#return; {90#true} is VALID [2020-07-18 00:14:41,848 INFO L280 TraceCheckUtils]: 15: Hoare triple {90#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {90#true} is VALID [2020-07-18 00:14:41,849 INFO L280 TraceCheckUtils]: 16: Hoare triple {90#true} ~i~0 := #t~nondet9; {90#true} is VALID [2020-07-18 00:14:41,849 INFO L280 TraceCheckUtils]: 17: Hoare triple {90#true} havoc #t~nondet9; {90#true} is VALID [2020-07-18 00:14:41,850 INFO L263 TraceCheckUtils]: 18: Hoare triple {90#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {90#true} is VALID [2020-07-18 00:14:41,850 INFO L280 TraceCheckUtils]: 19: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-18 00:14:41,851 INFO L280 TraceCheckUtils]: 20: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-18 00:14:41,851 INFO L280 TraceCheckUtils]: 21: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 00:14:41,851 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {90#true} {90#true} #101#return; {90#true} is VALID [2020-07-18 00:14:41,852 INFO L280 TraceCheckUtils]: 23: Hoare triple {90#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {90#true} is VALID [2020-07-18 00:14:41,854 INFO L263 TraceCheckUtils]: 24: Hoare triple {90#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {115#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:14:41,854 INFO L280 TraceCheckUtils]: 25: Hoare triple {115#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {90#true} is VALID [2020-07-18 00:14:41,855 INFO L280 TraceCheckUtils]: 26: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 00:14:41,855 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {90#true} {90#true} #103#return; {90#true} is VALID [2020-07-18 00:14:41,856 INFO L280 TraceCheckUtils]: 28: Hoare triple {90#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {90#true} is VALID [2020-07-18 00:14:41,858 INFO L263 TraceCheckUtils]: 29: Hoare triple {90#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {108#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 00:14:41,860 INFO L280 TraceCheckUtils]: 30: Hoare triple {108#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {109#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:14:41,861 INFO L280 TraceCheckUtils]: 31: Hoare triple {109#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:41,862 INFO L280 TraceCheckUtils]: 32: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:41,863 INFO L280 TraceCheckUtils]: 33: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:41,864 INFO L280 TraceCheckUtils]: 34: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:41,865 INFO L280 TraceCheckUtils]: 35: Hoare triple {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:41,867 INFO L263 TraceCheckUtils]: 36: Hoare triple {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {112#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:14:41,868 INFO L280 TraceCheckUtils]: 37: Hoare triple {112#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {113#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:14:41,869 INFO L280 TraceCheckUtils]: 38: Hoare triple {113#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {91#false} is VALID [2020-07-18 00:14:41,869 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#false} assume !false; {91#false} is VALID [2020-07-18 00:14:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-18 00:14:41,879 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:41,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [868771600] [2020-07-18 00:14:41,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:41,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:14:41,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885189962] [2020-07-18 00:14:41,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-18 00:14:41,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:41,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:14:41,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:41,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:14:41,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:41,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:14:41,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:14:41,987 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-07-18 00:14:44,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:44,921 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-07-18 00:14:44,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 00:14:44,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-18 00:14:44,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2020-07-18 00:14:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:44,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2020-07-18 00:14:44,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 257 transitions. [2020-07-18 00:14:45,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:45,369 INFO L225 Difference]: With dead ends: 221 [2020-07-18 00:14:45,370 INFO L226 Difference]: Without dead ends: 138 [2020-07-18 00:14:45,379 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-07-18 00:14:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-18 00:14:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-07-18 00:14:45,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:45,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 122 states. [2020-07-18 00:14:45,703 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 122 states. [2020-07-18 00:14:45,703 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 122 states. [2020-07-18 00:14:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:45,716 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-18 00:14:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-07-18 00:14:45,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:45,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:45,720 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 138 states. [2020-07-18 00:14:45,720 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 138 states. [2020-07-18 00:14:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:45,731 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-18 00:14:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-07-18 00:14:45,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:45,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:45,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:45,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-18 00:14:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-07-18 00:14:45,749 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-07-18 00:14:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:45,749 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-07-18 00:14:45,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:14:45,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 122 states and 132 transitions. [2020-07-18 00:14:45,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-07-18 00:14:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 00:14:45,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:45,951 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:45,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:45,951 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:45,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-07-18 00:14:45,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:45,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1215584594] [2020-07-18 00:14:45,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:46,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1097#true} is VALID [2020-07-18 00:14:46,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} #valid := #valid[0 := 0]; {1097#true} is VALID [2020-07-18 00:14:46,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume 0 < #StackHeapBarrier; {1097#true} is VALID [2020-07-18 00:14:46,205 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 00:14:46,206 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2020-07-18 00:14:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:46,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-18 00:14:46,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-18 00:14:46,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 00:14:46,214 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #99#return; {1097#true} is VALID [2020-07-18 00:14:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:46,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-18 00:14:46,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-18 00:14:46,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 00:14:46,227 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #101#return; {1097#true} is VALID [2020-07-18 00:14:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:46,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {1133#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:14:46,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:14:46,289 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1097#true} #103#return; {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 00:14:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:46,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~x := #in~x; {1097#true} is VALID [2020-07-18 00:14:46,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} ~y := #in~y; {1097#true} is VALID [2020-07-18 00:14:46,298 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1097#true} is VALID [2020-07-18 00:14:46,299 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} ~i := #in~i; {1097#true} is VALID [2020-07-18 00:14:46,299 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#true} ~n := #in~n; {1097#true} is VALID [2020-07-18 00:14:46,299 INFO L280 TraceCheckUtils]: 5: Hoare triple {1097#true} assume ~x >= ~y; {1097#true} is VALID [2020-07-18 00:14:46,299 INFO L280 TraceCheckUtils]: 6: Hoare triple {1097#true} #res := ~x; {1097#true} is VALID [2020-07-18 00:14:46,300 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 00:14:46,306 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1097#true} {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} #105#return; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 00:14:46,313 INFO L263 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:14:46,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1097#true} is VALID [2020-07-18 00:14:46,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} #valid := #valid[0 := 0]; {1097#true} is VALID [2020-07-18 00:14:46,314 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} assume 0 < #StackHeapBarrier; {1097#true} is VALID [2020-07-18 00:14:46,314 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 00:14:46,314 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2020-07-18 00:14:46,315 INFO L263 TraceCheckUtils]: 6: Hoare triple {1097#true} call #t~ret14 := main(); {1097#true} is VALID [2020-07-18 00:14:46,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1097#true} is VALID [2020-07-18 00:14:46,318 INFO L280 TraceCheckUtils]: 8: Hoare triple {1097#true} ~n~0 := #t~nondet8; {1097#true} is VALID [2020-07-18 00:14:46,318 INFO L280 TraceCheckUtils]: 9: Hoare triple {1097#true} havoc #t~nondet8; {1097#true} is VALID [2020-07-18 00:14:46,318 INFO L263 TraceCheckUtils]: 10: Hoare triple {1097#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1097#true} is VALID [2020-07-18 00:14:46,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-18 00:14:46,319 INFO L280 TraceCheckUtils]: 12: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-18 00:14:46,319 INFO L280 TraceCheckUtils]: 13: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 00:14:46,319 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1097#true} {1097#true} #99#return; {1097#true} is VALID [2020-07-18 00:14:46,320 INFO L280 TraceCheckUtils]: 15: Hoare triple {1097#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1097#true} is VALID [2020-07-18 00:14:46,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {1097#true} ~i~0 := #t~nondet9; {1097#true} is VALID [2020-07-18 00:14:46,321 INFO L280 TraceCheckUtils]: 17: Hoare triple {1097#true} havoc #t~nondet9; {1097#true} is VALID [2020-07-18 00:14:46,321 INFO L263 TraceCheckUtils]: 18: Hoare triple {1097#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1097#true} is VALID [2020-07-18 00:14:46,321 INFO L280 TraceCheckUtils]: 19: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-18 00:14:46,322 INFO L280 TraceCheckUtils]: 20: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-18 00:14:46,322 INFO L280 TraceCheckUtils]: 21: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 00:14:46,322 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1097#true} {1097#true} #101#return; {1097#true} is VALID [2020-07-18 00:14:46,322 INFO L280 TraceCheckUtils]: 23: Hoare triple {1097#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {1097#true} is VALID [2020-07-18 00:14:46,324 INFO L263 TraceCheckUtils]: 24: Hoare triple {1097#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1133#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:14:46,324 INFO L280 TraceCheckUtils]: 25: Hoare triple {1133#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:14:46,325 INFO L280 TraceCheckUtils]: 26: Hoare triple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:14:46,326 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1097#true} #103#return; {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 00:14:46,328 INFO L280 TraceCheckUtils]: 28: Hoare triple {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 00:14:46,328 INFO L263 TraceCheckUtils]: 29: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1097#true} is VALID [2020-07-18 00:14:46,328 INFO L280 TraceCheckUtils]: 30: Hoare triple {1097#true} ~x := #in~x; {1097#true} is VALID [2020-07-18 00:14:46,328 INFO L280 TraceCheckUtils]: 31: Hoare triple {1097#true} ~y := #in~y; {1097#true} is VALID [2020-07-18 00:14:46,328 INFO L280 TraceCheckUtils]: 32: Hoare triple {1097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1097#true} is VALID [2020-07-18 00:14:46,329 INFO L280 TraceCheckUtils]: 33: Hoare triple {1097#true} ~i := #in~i; {1097#true} is VALID [2020-07-18 00:14:46,329 INFO L280 TraceCheckUtils]: 34: Hoare triple {1097#true} ~n := #in~n; {1097#true} is VALID [2020-07-18 00:14:46,330 INFO L280 TraceCheckUtils]: 35: Hoare triple {1097#true} assume ~x >= ~y; {1097#true} is VALID [2020-07-18 00:14:46,330 INFO L280 TraceCheckUtils]: 36: Hoare triple {1097#true} #res := ~x; {1097#true} is VALID [2020-07-18 00:14:46,331 INFO L280 TraceCheckUtils]: 37: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 00:14:46,335 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1097#true} {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} #105#return; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 00:14:46,337 INFO L280 TraceCheckUtils]: 39: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 00:14:46,352 INFO L280 TraceCheckUtils]: 40: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} ~x~0 := #t~ret11; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 00:14:46,353 INFO L280 TraceCheckUtils]: 41: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} havoc #t~ret11; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 00:14:46,354 INFO L280 TraceCheckUtils]: 42: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} SUMMARY for call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L46 {1126#(and (= |main_#t~mem12| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-18 00:14:46,360 INFO L280 TraceCheckUtils]: 43: Hoare triple {1126#(and (= |main_#t~mem12| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} ~ai~1 := #t~mem12; {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-18 00:14:46,361 INFO L280 TraceCheckUtils]: 44: Hoare triple {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} havoc #t~mem12; {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-18 00:14:46,361 INFO L280 TraceCheckUtils]: 45: Hoare triple {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} SUMMARY for call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); srcloc: L47 {1128#(and (= |main_#t~mem13| 0) (= 0 main_~ai~1))} is VALID [2020-07-18 00:14:46,363 INFO L280 TraceCheckUtils]: 46: Hoare triple {1128#(and (= |main_#t~mem13| 0) (= 0 main_~ai~1))} ~ax~1 := #t~mem13; {1129#(<= main_~ai~1 main_~ax~1)} is VALID [2020-07-18 00:14:46,367 INFO L280 TraceCheckUtils]: 47: Hoare triple {1129#(<= main_~ai~1 main_~ax~1)} havoc #t~mem13; {1129#(<= main_~ai~1 main_~ax~1)} is VALID [2020-07-18 00:14:46,367 INFO L263 TraceCheckUtils]: 48: Hoare triple {1129#(<= main_~ai~1 main_~ax~1)} call __VERIFIER_assert((if ~ai~1 <= ~ax~1 then 1 else 0)); {1130#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:14:46,368 INFO L280 TraceCheckUtils]: 49: Hoare triple {1130#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1131#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:14:46,368 INFO L280 TraceCheckUtils]: 50: Hoare triple {1131#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1098#false} is VALID [2020-07-18 00:14:46,369 INFO L280 TraceCheckUtils]: 51: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2020-07-18 00:14:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-18 00:14:46,373 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:46,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1215584594] [2020-07-18 00:14:46,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:46,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-18 00:14:46,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928475029] [2020-07-18 00:14:46,375 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-18 00:14:46,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:46,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 00:14:46,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:46,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 00:14:46,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 00:14:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:14:46,436 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-07-18 00:14:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:49,003 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-18 00:14:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 00:14:49,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-18 00:14:49,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:14:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2020-07-18 00:14:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:14:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2020-07-18 00:14:49,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 91 transitions. [2020-07-18 00:14:49,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:49,141 INFO L225 Difference]: With dead ends: 128 [2020-07-18 00:14:49,141 INFO L226 Difference]: Without dead ends: 108 [2020-07-18 00:14:49,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-07-18 00:14:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-18 00:14:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-07-18 00:14:49,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:49,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 108 states. [2020-07-18 00:14:49,410 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2020-07-18 00:14:49,410 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2020-07-18 00:14:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:49,419 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-18 00:14:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-18 00:14:49,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:49,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:49,422 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2020-07-18 00:14:49,422 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2020-07-18 00:14:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:49,436 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-18 00:14:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-18 00:14:49,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:49,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:49,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:49,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-18 00:14:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-07-18 00:14:49,449 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-07-18 00:14:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:49,451 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-07-18 00:14:49,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 00:14:49,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 116 transitions. [2020-07-18 00:14:49,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-18 00:14:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 00:14:49,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:49,647 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:49,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:49,648 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:49,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-07-18 00:14:49,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:49,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535310977] [2020-07-18 00:14:49,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:49,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1850#true} is VALID [2020-07-18 00:14:49,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} #valid := #valid[0 := 0]; {1850#true} is VALID [2020-07-18 00:14:49,966 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume 0 < #StackHeapBarrier; {1850#true} is VALID [2020-07-18 00:14:49,966 INFO L280 TraceCheckUtils]: 3: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:49,966 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1850#true} {1850#true} #117#return; {1850#true} is VALID [2020-07-18 00:14:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:49,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 00:14:49,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 00:14:49,969 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:49,970 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #99#return; {1850#true} is VALID [2020-07-18 00:14:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:49,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 00:14:49,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 00:14:49,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:49,977 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #101#return; {1850#true} is VALID [2020-07-18 00:14:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:50,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {1888#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1850#true} is VALID [2020-07-18 00:14:50,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,006 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1850#true} {1850#true} #103#return; {1850#true} is VALID [2020-07-18 00:14:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:50,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 00:14:50,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 00:14:50,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,026 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:50,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 00:14:50,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 00:14:50,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,038 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,039 INFO L263 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:14:50,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1850#true} is VALID [2020-07-18 00:14:50,039 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} #valid := #valid[0 := 0]; {1850#true} is VALID [2020-07-18 00:14:50,040 INFO L280 TraceCheckUtils]: 3: Hoare triple {1850#true} assume 0 < #StackHeapBarrier; {1850#true} is VALID [2020-07-18 00:14:50,040 INFO L280 TraceCheckUtils]: 4: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,040 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1850#true} {1850#true} #117#return; {1850#true} is VALID [2020-07-18 00:14:50,040 INFO L263 TraceCheckUtils]: 6: Hoare triple {1850#true} call #t~ret14 := main(); {1850#true} is VALID [2020-07-18 00:14:50,040 INFO L280 TraceCheckUtils]: 7: Hoare triple {1850#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1850#true} is VALID [2020-07-18 00:14:50,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {1850#true} ~n~0 := #t~nondet8; {1850#true} is VALID [2020-07-18 00:14:50,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {1850#true} havoc #t~nondet8; {1850#true} is VALID [2020-07-18 00:14:50,041 INFO L263 TraceCheckUtils]: 10: Hoare triple {1850#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1850#true} is VALID [2020-07-18 00:14:50,041 INFO L280 TraceCheckUtils]: 11: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 00:14:50,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 00:14:50,041 INFO L280 TraceCheckUtils]: 13: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,042 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1850#true} {1850#true} #99#return; {1850#true} is VALID [2020-07-18 00:14:50,042 INFO L280 TraceCheckUtils]: 15: Hoare triple {1850#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1850#true} is VALID [2020-07-18 00:14:50,042 INFO L280 TraceCheckUtils]: 16: Hoare triple {1850#true} ~i~0 := #t~nondet9; {1850#true} is VALID [2020-07-18 00:14:50,042 INFO L280 TraceCheckUtils]: 17: Hoare triple {1850#true} havoc #t~nondet9; {1850#true} is VALID [2020-07-18 00:14:50,043 INFO L263 TraceCheckUtils]: 18: Hoare triple {1850#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1850#true} is VALID [2020-07-18 00:14:50,043 INFO L280 TraceCheckUtils]: 19: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 00:14:50,043 INFO L280 TraceCheckUtils]: 20: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 00:14:50,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,044 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1850#true} {1850#true} #101#return; {1850#true} is VALID [2020-07-18 00:14:50,044 INFO L280 TraceCheckUtils]: 23: Hoare triple {1850#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {1850#true} is VALID [2020-07-18 00:14:50,048 INFO L263 TraceCheckUtils]: 24: Hoare triple {1850#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1888#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:14:50,048 INFO L280 TraceCheckUtils]: 25: Hoare triple {1888#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1850#true} is VALID [2020-07-18 00:14:50,049 INFO L280 TraceCheckUtils]: 26: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,049 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1850#true} {1850#true} #103#return; {1850#true} is VALID [2020-07-18 00:14:50,049 INFO L280 TraceCheckUtils]: 28: Hoare triple {1850#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {1850#true} is VALID [2020-07-18 00:14:50,050 INFO L263 TraceCheckUtils]: 29: Hoare triple {1850#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1868#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 00:14:50,051 INFO L280 TraceCheckUtils]: 30: Hoare triple {1868#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {1869#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:14:50,051 INFO L280 TraceCheckUtils]: 31: Hoare triple {1869#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:50,052 INFO L280 TraceCheckUtils]: 32: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:50,052 INFO L280 TraceCheckUtils]: 33: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:50,056 INFO L280 TraceCheckUtils]: 34: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,057 INFO L280 TraceCheckUtils]: 35: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,057 INFO L263 TraceCheckUtils]: 36: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1850#true} is VALID [2020-07-18 00:14:50,058 INFO L280 TraceCheckUtils]: 37: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 00:14:50,058 INFO L280 TraceCheckUtils]: 38: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 00:14:50,058 INFO L280 TraceCheckUtils]: 39: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,059 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,059 INFO L263 TraceCheckUtils]: 41: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {1850#true} is VALID [2020-07-18 00:14:50,060 INFO L280 TraceCheckUtils]: 42: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 00:14:50,060 INFO L280 TraceCheckUtils]: 43: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 00:14:50,060 INFO L280 TraceCheckUtils]: 44: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 00:14:50,061 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,062 INFO L280 TraceCheckUtils]: 46: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,062 INFO L280 TraceCheckUtils]: 47: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,063 INFO L280 TraceCheckUtils]: 48: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,064 INFO L280 TraceCheckUtils]: 49: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,070 INFO L280 TraceCheckUtils]: 50: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,075 INFO L280 TraceCheckUtils]: 51: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,075 INFO L280 TraceCheckUtils]: 52: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,076 INFO L280 TraceCheckUtils]: 53: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {1880#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:50,077 INFO L280 TraceCheckUtils]: 54: Hoare triple {1880#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:14:50,077 INFO L280 TraceCheckUtils]: 55: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:14:50,079 INFO L263 TraceCheckUtils]: 56: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {1882#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:14:50,079 INFO L280 TraceCheckUtils]: 57: Hoare triple {1882#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {1883#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:14:50,080 INFO L280 TraceCheckUtils]: 58: Hoare triple {1883#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:14:50,081 INFO L280 TraceCheckUtils]: 59: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:14:50,083 INFO L280 TraceCheckUtils]: 60: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:14:50,083 INFO L280 TraceCheckUtils]: 61: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:14:50,084 INFO L280 TraceCheckUtils]: 62: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:14:50,084 INFO L263 TraceCheckUtils]: 63: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1885#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:14:50,088 INFO L280 TraceCheckUtils]: 64: Hoare triple {1885#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1886#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:14:50,089 INFO L280 TraceCheckUtils]: 65: Hoare triple {1886#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1851#false} is VALID [2020-07-18 00:14:50,089 INFO L280 TraceCheckUtils]: 66: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2020-07-18 00:14:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-18 00:14:50,096 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:50,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535310977] [2020-07-18 00:14:50,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:50,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:14:50,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300240786] [2020-07-18 00:14:50,098 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-18 00:14:50,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:50,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:14:50,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:50,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:14:50,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:50,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:14:50,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:14:50,170 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-07-18 00:14:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:55,494 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-07-18 00:14:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-18 00:14:55,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-18 00:14:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:14:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2020-07-18 00:14:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:14:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2020-07-18 00:14:55,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 191 transitions. [2020-07-18 00:14:55,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:55,831 INFO L225 Difference]: With dead ends: 179 [2020-07-18 00:14:55,832 INFO L226 Difference]: Without dead ends: 177 [2020-07-18 00:14:55,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-07-18 00:14:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-18 00:14:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-07-18 00:14:56,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:56,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 151 states. [2020-07-18 00:14:56,234 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 151 states. [2020-07-18 00:14:56,234 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 151 states. [2020-07-18 00:14:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:56,245 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-07-18 00:14:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-07-18 00:14:56,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:56,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:56,246 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 177 states. [2020-07-18 00:14:56,246 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 177 states. [2020-07-18 00:14:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:56,254 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-07-18 00:14:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-07-18 00:14:56,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:56,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:56,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:56,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-18 00:14:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-07-18 00:14:56,264 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-07-18 00:14:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:56,266 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-07-18 00:14:56,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:14:56,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 151 states and 164 transitions. [2020-07-18 00:14:56,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-07-18 00:14:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 00:14:56,523 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:56,523 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:56,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:14:56,523 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:56,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:56,524 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-07-18 00:14:56,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:56,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [122469613] [2020-07-18 00:14:56,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:56,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2937#true} is VALID [2020-07-18 00:14:56,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-18 00:14:56,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-18 00:14:56,807 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,807 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2937#true} {2937#true} #117#return; {2937#true} is VALID [2020-07-18 00:14:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:56,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 00:14:56,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 00:14:56,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,816 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-18 00:14:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:56,827 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 00:14:56,827 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 00:14:56,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,828 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #101#return; {2937#true} is VALID [2020-07-18 00:14:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:56,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {2975#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2937#true} is VALID [2020-07-18 00:14:56,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,850 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-18 00:14:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:56,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 00:14:56,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 00:14:56,866 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,867 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:56,874 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 00:14:56,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 00:14:56,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,875 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,879 INFO L263 TraceCheckUtils]: 0: Hoare triple {2937#true} call ULTIMATE.init(); {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:14:56,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2937#true} is VALID [2020-07-18 00:14:56,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-18 00:14:56,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-18 00:14:56,880 INFO L280 TraceCheckUtils]: 4: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,881 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2937#true} {2937#true} #117#return; {2937#true} is VALID [2020-07-18 00:14:56,881 INFO L263 TraceCheckUtils]: 6: Hoare triple {2937#true} call #t~ret14 := main(); {2937#true} is VALID [2020-07-18 00:14:56,881 INFO L280 TraceCheckUtils]: 7: Hoare triple {2937#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2937#true} is VALID [2020-07-18 00:14:56,882 INFO L280 TraceCheckUtils]: 8: Hoare triple {2937#true} ~n~0 := #t~nondet8; {2937#true} is VALID [2020-07-18 00:14:56,883 INFO L280 TraceCheckUtils]: 9: Hoare triple {2937#true} havoc #t~nondet8; {2937#true} is VALID [2020-07-18 00:14:56,883 INFO L263 TraceCheckUtils]: 10: Hoare triple {2937#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {2937#true} is VALID [2020-07-18 00:14:56,883 INFO L280 TraceCheckUtils]: 11: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 00:14:56,883 INFO L280 TraceCheckUtils]: 12: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 00:14:56,883 INFO L280 TraceCheckUtils]: 13: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,883 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-18 00:14:56,884 INFO L280 TraceCheckUtils]: 15: Hoare triple {2937#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2937#true} is VALID [2020-07-18 00:14:56,884 INFO L280 TraceCheckUtils]: 16: Hoare triple {2937#true} ~i~0 := #t~nondet9; {2937#true} is VALID [2020-07-18 00:14:56,884 INFO L280 TraceCheckUtils]: 17: Hoare triple {2937#true} havoc #t~nondet9; {2937#true} is VALID [2020-07-18 00:14:56,884 INFO L263 TraceCheckUtils]: 18: Hoare triple {2937#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {2937#true} is VALID [2020-07-18 00:14:56,885 INFO L280 TraceCheckUtils]: 19: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 00:14:56,885 INFO L280 TraceCheckUtils]: 20: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 00:14:56,885 INFO L280 TraceCheckUtils]: 21: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,885 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2937#true} {2937#true} #101#return; {2937#true} is VALID [2020-07-18 00:14:56,885 INFO L280 TraceCheckUtils]: 23: Hoare triple {2937#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {2937#true} is VALID [2020-07-18 00:14:56,886 INFO L263 TraceCheckUtils]: 24: Hoare triple {2937#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {2975#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:14:56,886 INFO L280 TraceCheckUtils]: 25: Hoare triple {2975#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2937#true} is VALID [2020-07-18 00:14:56,887 INFO L280 TraceCheckUtils]: 26: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,887 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-18 00:14:56,887 INFO L280 TraceCheckUtils]: 28: Hoare triple {2937#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {2937#true} is VALID [2020-07-18 00:14:56,888 INFO L263 TraceCheckUtils]: 29: Hoare triple {2937#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {2955#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 00:14:56,889 INFO L280 TraceCheckUtils]: 30: Hoare triple {2955#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {2956#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:14:56,889 INFO L280 TraceCheckUtils]: 31: Hoare triple {2956#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:56,890 INFO L280 TraceCheckUtils]: 32: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:56,890 INFO L280 TraceCheckUtils]: 33: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:14:56,891 INFO L280 TraceCheckUtils]: 34: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,891 INFO L280 TraceCheckUtils]: 35: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,891 INFO L263 TraceCheckUtils]: 36: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {2937#true} is VALID [2020-07-18 00:14:56,892 INFO L280 TraceCheckUtils]: 37: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 00:14:56,892 INFO L280 TraceCheckUtils]: 38: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 00:14:56,892 INFO L280 TraceCheckUtils]: 39: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,892 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,893 INFO L263 TraceCheckUtils]: 41: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {2937#true} is VALID [2020-07-18 00:14:56,893 INFO L280 TraceCheckUtils]: 42: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 00:14:56,893 INFO L280 TraceCheckUtils]: 43: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 00:14:56,893 INFO L280 TraceCheckUtils]: 44: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 00:14:56,894 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,894 INFO L280 TraceCheckUtils]: 46: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,895 INFO L280 TraceCheckUtils]: 47: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,895 INFO L280 TraceCheckUtils]: 48: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,896 INFO L280 TraceCheckUtils]: 49: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,897 INFO L280 TraceCheckUtils]: 50: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(#t~mem1 <= #t~mem2); {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,898 INFO L280 TraceCheckUtils]: 51: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,899 INFO L280 TraceCheckUtils]: 52: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:14:56,899 INFO L280 TraceCheckUtils]: 53: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post4 := ~y; {2967#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-18 00:14:56,900 INFO L280 TraceCheckUtils]: 54: Hoare triple {2967#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:14:56,901 INFO L280 TraceCheckUtils]: 55: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:14:56,902 INFO L263 TraceCheckUtils]: 56: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {2969#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:14:56,902 INFO L280 TraceCheckUtils]: 57: Hoare triple {2969#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {2970#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:14:56,904 INFO L280 TraceCheckUtils]: 58: Hoare triple {2970#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:14:56,904 INFO L280 TraceCheckUtils]: 59: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:14:56,905 INFO L280 TraceCheckUtils]: 60: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:14:56,905 INFO L280 TraceCheckUtils]: 61: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:14:56,906 INFO L280 TraceCheckUtils]: 62: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:14:56,907 INFO L263 TraceCheckUtils]: 63: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {2972#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:14:56,907 INFO L280 TraceCheckUtils]: 64: Hoare triple {2972#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2973#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:14:56,908 INFO L280 TraceCheckUtils]: 65: Hoare triple {2973#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2938#false} is VALID [2020-07-18 00:14:56,908 INFO L280 TraceCheckUtils]: 66: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2020-07-18 00:14:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-18 00:14:56,913 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:56,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [122469613] [2020-07-18 00:14:56,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:56,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:14:56,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432074863] [2020-07-18 00:14:56,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-18 00:14:56,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:56,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:14:56,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:56,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:14:56,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:14:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:14:56,990 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-07-18 00:15:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:01,711 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-07-18 00:15:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-18 00:15:01,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-18 00:15:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:15:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:15:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 193 transitions. [2020-07-18 00:15:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:15:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 193 transitions. [2020-07-18 00:15:01,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 193 transitions. [2020-07-18 00:15:02,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:02,066 INFO L225 Difference]: With dead ends: 221 [2020-07-18 00:15:02,066 INFO L226 Difference]: Without dead ends: 219 [2020-07-18 00:15:02,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-07-18 00:15:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-18 00:15:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-07-18 00:15:02,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:15:02,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 194 states. [2020-07-18 00:15:02,664 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 194 states. [2020-07-18 00:15:02,664 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 194 states. [2020-07-18 00:15:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:02,673 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2020-07-18 00:15:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2020-07-18 00:15:02,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:02,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:02,676 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 219 states. [2020-07-18 00:15:02,676 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 219 states. [2020-07-18 00:15:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:02,690 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2020-07-18 00:15:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2020-07-18 00:15:02,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:02,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:02,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:15:02,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:15:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-18 00:15:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-07-18 00:15:02,699 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-07-18 00:15:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:15:02,699 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-07-18 00:15:02,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:15:02,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 194 states and 212 transitions. [2020-07-18 00:15:03,077 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-07-18 00:15:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-18 00:15:03,079 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:15:03,080 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:15:03,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:15:03,080 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:15:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:15:03,081 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-07-18 00:15:03,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:15:03,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [389503265] [2020-07-18 00:15:03,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:15:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:03,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4283#true} is VALID [2020-07-18 00:15:03,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} #valid := #valid[0 := 0]; {4283#true} is VALID [2020-07-18 00:15:03,324 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume 0 < #StackHeapBarrier; {4283#true} is VALID [2020-07-18 00:15:03,324 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,325 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4283#true} {4283#true} #117#return; {4283#true} is VALID [2020-07-18 00:15:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:03,329 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 00:15:03,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 00:15:03,330 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,330 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4283#true} #99#return; {4283#true} is VALID [2020-07-18 00:15:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:03,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 00:15:03,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 00:15:03,334 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,334 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4283#true} #101#return; {4283#true} is VALID [2020-07-18 00:15:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:03,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {4329#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:15:03,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:15:03,375 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {4283#true} #103#return; {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 00:15:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:03,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 00:15:03,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 00:15:03,383 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,384 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:03,389 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 00:15:03,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 00:15:03,390 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,391 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:03,396 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~x := #in~x; {4283#true} is VALID [2020-07-18 00:15:03,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} ~y := #in~y; {4283#true} is VALID [2020-07-18 00:15:03,397 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4283#true} is VALID [2020-07-18 00:15:03,397 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} ~i := #in~i; {4283#true} is VALID [2020-07-18 00:15:03,398 INFO L280 TraceCheckUtils]: 4: Hoare triple {4283#true} ~n := #in~n; {4283#true} is VALID [2020-07-18 00:15:03,398 INFO L280 TraceCheckUtils]: 5: Hoare triple {4283#true} assume ~x >= ~y; {4283#true} is VALID [2020-07-18 00:15:03,398 INFO L280 TraceCheckUtils]: 6: Hoare triple {4283#true} #res := ~x; {4283#true} is VALID [2020-07-18 00:15:03,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,400 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #113#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,401 INFO L263 TraceCheckUtils]: 0: Hoare triple {4283#true} call ULTIMATE.init(); {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:15:03,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4283#true} is VALID [2020-07-18 00:15:03,401 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} #valid := #valid[0 := 0]; {4283#true} is VALID [2020-07-18 00:15:03,401 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} assume 0 < #StackHeapBarrier; {4283#true} is VALID [2020-07-18 00:15:03,401 INFO L280 TraceCheckUtils]: 4: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,402 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4283#true} {4283#true} #117#return; {4283#true} is VALID [2020-07-18 00:15:03,402 INFO L263 TraceCheckUtils]: 6: Hoare triple {4283#true} call #t~ret14 := main(); {4283#true} is VALID [2020-07-18 00:15:03,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {4283#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4283#true} is VALID [2020-07-18 00:15:03,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {4283#true} ~n~0 := #t~nondet8; {4283#true} is VALID [2020-07-18 00:15:03,403 INFO L280 TraceCheckUtils]: 9: Hoare triple {4283#true} havoc #t~nondet8; {4283#true} is VALID [2020-07-18 00:15:03,403 INFO L263 TraceCheckUtils]: 10: Hoare triple {4283#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {4283#true} is VALID [2020-07-18 00:15:03,403 INFO L280 TraceCheckUtils]: 11: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 00:15:03,403 INFO L280 TraceCheckUtils]: 12: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 00:15:03,404 INFO L280 TraceCheckUtils]: 13: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,404 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {4283#true} {4283#true} #99#return; {4283#true} is VALID [2020-07-18 00:15:03,404 INFO L280 TraceCheckUtils]: 15: Hoare triple {4283#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {4283#true} is VALID [2020-07-18 00:15:03,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {4283#true} ~i~0 := #t~nondet9; {4283#true} is VALID [2020-07-18 00:15:03,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {4283#true} havoc #t~nondet9; {4283#true} is VALID [2020-07-18 00:15:03,405 INFO L263 TraceCheckUtils]: 18: Hoare triple {4283#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {4283#true} is VALID [2020-07-18 00:15:03,405 INFO L280 TraceCheckUtils]: 19: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 00:15:03,405 INFO L280 TraceCheckUtils]: 20: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 00:15:03,405 INFO L280 TraceCheckUtils]: 21: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,406 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4283#true} {4283#true} #101#return; {4283#true} is VALID [2020-07-18 00:15:03,406 INFO L280 TraceCheckUtils]: 23: Hoare triple {4283#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {4283#true} is VALID [2020-07-18 00:15:03,407 INFO L263 TraceCheckUtils]: 24: Hoare triple {4283#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {4329#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:15:03,408 INFO L280 TraceCheckUtils]: 25: Hoare triple {4329#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:15:03,409 INFO L280 TraceCheckUtils]: 26: Hoare triple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:15:03,410 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {4283#true} #103#return; {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 00:15:03,411 INFO L280 TraceCheckUtils]: 28: Hoare triple {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {4302#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 00:15:03,412 INFO L263 TraceCheckUtils]: 29: Hoare triple {4302#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:03,413 INFO L280 TraceCheckUtils]: 30: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:03,414 INFO L280 TraceCheckUtils]: 31: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:03,415 INFO L280 TraceCheckUtils]: 32: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,417 INFO L280 TraceCheckUtils]: 33: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,421 INFO L280 TraceCheckUtils]: 34: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,425 INFO L280 TraceCheckUtils]: 35: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,426 INFO L263 TraceCheckUtils]: 36: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {4283#true} is VALID [2020-07-18 00:15:03,426 INFO L280 TraceCheckUtils]: 37: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 00:15:03,426 INFO L280 TraceCheckUtils]: 38: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 00:15:03,426 INFO L280 TraceCheckUtils]: 39: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,430 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,430 INFO L263 TraceCheckUtils]: 41: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {4283#true} is VALID [2020-07-18 00:15:03,430 INFO L280 TraceCheckUtils]: 42: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 00:15:03,430 INFO L280 TraceCheckUtils]: 43: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 00:15:03,431 INFO L280 TraceCheckUtils]: 44: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,432 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,439 INFO L280 TraceCheckUtils]: 46: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,439 INFO L280 TraceCheckUtils]: 47: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,440 INFO L280 TraceCheckUtils]: 48: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,441 INFO L280 TraceCheckUtils]: 49: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,441 INFO L280 TraceCheckUtils]: 50: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,442 INFO L280 TraceCheckUtils]: 51: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem1; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,442 INFO L280 TraceCheckUtils]: 52: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem2; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,443 INFO L280 TraceCheckUtils]: 53: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #t~post3 := ~x; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,444 INFO L280 TraceCheckUtils]: 54: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x := 1 + #t~post3; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,444 INFO L280 TraceCheckUtils]: 55: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~post3; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,444 INFO L263 TraceCheckUtils]: 56: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {4283#true} is VALID [2020-07-18 00:15:03,445 INFO L280 TraceCheckUtils]: 57: Hoare triple {4283#true} ~x := #in~x; {4283#true} is VALID [2020-07-18 00:15:03,445 INFO L280 TraceCheckUtils]: 58: Hoare triple {4283#true} ~y := #in~y; {4283#true} is VALID [2020-07-18 00:15:03,445 INFO L280 TraceCheckUtils]: 59: Hoare triple {4283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4283#true} is VALID [2020-07-18 00:15:03,445 INFO L280 TraceCheckUtils]: 60: Hoare triple {4283#true} ~i := #in~i; {4283#true} is VALID [2020-07-18 00:15:03,445 INFO L280 TraceCheckUtils]: 61: Hoare triple {4283#true} ~n := #in~n; {4283#true} is VALID [2020-07-18 00:15:03,446 INFO L280 TraceCheckUtils]: 62: Hoare triple {4283#true} assume ~x >= ~y; {4283#true} is VALID [2020-07-18 00:15:03,446 INFO L280 TraceCheckUtils]: 63: Hoare triple {4283#true} #res := ~x; {4283#true} is VALID [2020-07-18 00:15:03,446 INFO L280 TraceCheckUtils]: 64: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 00:15:03,448 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #113#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,449 INFO L280 TraceCheckUtils]: 66: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,449 INFO L280 TraceCheckUtils]: 67: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x1~0 := #t~ret5; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,450 INFO L280 TraceCheckUtils]: 68: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~ret5; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:03,451 INFO L280 TraceCheckUtils]: 69: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~i, 4); srcloc: L31 {4322#(and (= 0 |check_#t~mem6|) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-18 00:15:03,452 INFO L280 TraceCheckUtils]: 70: Hoare triple {4322#(and (= 0 |check_#t~mem6|) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} ~ai~0 := #t~mem6; {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-18 00:15:03,453 INFO L280 TraceCheckUtils]: 71: Hoare triple {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} havoc #t~mem6; {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-18 00:15:03,453 INFO L280 TraceCheckUtils]: 72: Hoare triple {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} SUMMARY for call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4); srcloc: L32 {4324#(and (= 0 check_~ai~0) (= 0 |check_#t~mem7|))} is VALID [2020-07-18 00:15:03,454 INFO L280 TraceCheckUtils]: 73: Hoare triple {4324#(and (= 0 check_~ai~0) (= 0 |check_#t~mem7|))} ~ax~0 := #t~mem7; {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-18 00:15:03,455 INFO L280 TraceCheckUtils]: 74: Hoare triple {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} havoc #t~mem7; {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-18 00:15:03,456 INFO L263 TraceCheckUtils]: 75: Hoare triple {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {4326#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:15:03,457 INFO L280 TraceCheckUtils]: 76: Hoare triple {4326#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4327#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:15:03,457 INFO L280 TraceCheckUtils]: 77: Hoare triple {4327#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4284#false} is VALID [2020-07-18 00:15:03,457 INFO L280 TraceCheckUtils]: 78: Hoare triple {4284#false} assume !false; {4284#false} is VALID [2020-07-18 00:15:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-18 00:15:03,466 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:15:03,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [389503265] [2020-07-18 00:15:03,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:15:03,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:15:03,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683867876] [2020-07-18 00:15:03,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-18 00:15:03,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:15:03,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:15:03,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:03,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:15:03,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:15:03,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:15:03,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:15:03,560 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-07-18 00:15:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:07,900 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-18 00:15:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 00:15:07,901 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-18 00:15:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:15:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:15:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2020-07-18 00:15:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:15:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2020-07-18 00:15:07,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2020-07-18 00:15:08,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:08,095 INFO L225 Difference]: With dead ends: 206 [2020-07-18 00:15:08,095 INFO L226 Difference]: Without dead ends: 142 [2020-07-18 00:15:08,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-07-18 00:15:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-18 00:15:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-07-18 00:15:08,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:15:08,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 113 states. [2020-07-18 00:15:08,461 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 113 states. [2020-07-18 00:15:08,462 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 113 states. [2020-07-18 00:15:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:08,468 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-18 00:15:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-18 00:15:08,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:08,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:08,470 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 142 states. [2020-07-18 00:15:08,470 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 142 states. [2020-07-18 00:15:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:08,475 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-18 00:15:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-18 00:15:08,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:08,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:08,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:15:08,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:15:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-18 00:15:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-07-18 00:15:08,488 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-07-18 00:15:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:15:08,488 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-07-18 00:15:08,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:15:08,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 120 transitions. [2020-07-18 00:15:08,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-07-18 00:15:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-18 00:15:08,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:15:08,716 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:15:08,716 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:15:08,717 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:15:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:15:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-07-18 00:15:08,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:15:08,717 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [797588167] [2020-07-18 00:15:08,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:15:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5287#true} is VALID [2020-07-18 00:15:09,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} #valid := #valid[0 := 0]; {5287#true} is VALID [2020-07-18 00:15:09,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume 0 < #StackHeapBarrier; {5287#true} is VALID [2020-07-18 00:15:09,181 INFO L280 TraceCheckUtils]: 3: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,181 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5287#true} {5287#true} #117#return; {5287#true} is VALID [2020-07-18 00:15:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,184 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #99#return; {5287#true} is VALID [2020-07-18 00:15:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,187 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #101#return; {5287#true} is VALID [2020-07-18 00:15:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {5338#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5287#true} is VALID [2020-07-18 00:15:09,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,217 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #103#return; {5287#true} is VALID [2020-07-18 00:15:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,229 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,244 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,252 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,253 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:09,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,262 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,262 INFO L263 TraceCheckUtils]: 0: Hoare triple {5287#true} call ULTIMATE.init(); {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:15:09,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5287#true} is VALID [2020-07-18 00:15:09,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} #valid := #valid[0 := 0]; {5287#true} is VALID [2020-07-18 00:15:09,263 INFO L280 TraceCheckUtils]: 3: Hoare triple {5287#true} assume 0 < #StackHeapBarrier; {5287#true} is VALID [2020-07-18 00:15:09,263 INFO L280 TraceCheckUtils]: 4: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,263 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5287#true} {5287#true} #117#return; {5287#true} is VALID [2020-07-18 00:15:09,264 INFO L263 TraceCheckUtils]: 6: Hoare triple {5287#true} call #t~ret14 := main(); {5287#true} is VALID [2020-07-18 00:15:09,264 INFO L280 TraceCheckUtils]: 7: Hoare triple {5287#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5287#true} is VALID [2020-07-18 00:15:09,264 INFO L280 TraceCheckUtils]: 8: Hoare triple {5287#true} ~n~0 := #t~nondet8; {5287#true} is VALID [2020-07-18 00:15:09,264 INFO L280 TraceCheckUtils]: 9: Hoare triple {5287#true} havoc #t~nondet8; {5287#true} is VALID [2020-07-18 00:15:09,264 INFO L263 TraceCheckUtils]: 10: Hoare triple {5287#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {5287#true} is VALID [2020-07-18 00:15:09,265 INFO L280 TraceCheckUtils]: 11: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,265 INFO L280 TraceCheckUtils]: 12: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,265 INFO L280 TraceCheckUtils]: 13: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,265 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {5287#true} {5287#true} #99#return; {5287#true} is VALID [2020-07-18 00:15:09,265 INFO L280 TraceCheckUtils]: 15: Hoare triple {5287#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {5287#true} is VALID [2020-07-18 00:15:09,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {5287#true} ~i~0 := #t~nondet9; {5287#true} is VALID [2020-07-18 00:15:09,266 INFO L280 TraceCheckUtils]: 17: Hoare triple {5287#true} havoc #t~nondet9; {5287#true} is VALID [2020-07-18 00:15:09,266 INFO L263 TraceCheckUtils]: 18: Hoare triple {5287#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {5287#true} is VALID [2020-07-18 00:15:09,266 INFO L280 TraceCheckUtils]: 19: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,267 INFO L280 TraceCheckUtils]: 21: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,267 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {5287#true} {5287#true} #101#return; {5287#true} is VALID [2020-07-18 00:15:09,267 INFO L280 TraceCheckUtils]: 23: Hoare triple {5287#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {5287#true} is VALID [2020-07-18 00:15:09,268 INFO L263 TraceCheckUtils]: 24: Hoare triple {5287#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {5338#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:15:09,268 INFO L280 TraceCheckUtils]: 25: Hoare triple {5338#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5287#true} is VALID [2020-07-18 00:15:09,269 INFO L280 TraceCheckUtils]: 26: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,269 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {5287#true} {5287#true} #103#return; {5287#true} is VALID [2020-07-18 00:15:09,269 INFO L280 TraceCheckUtils]: 28: Hoare triple {5287#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {5287#true} is VALID [2020-07-18 00:15:09,270 INFO L263 TraceCheckUtils]: 29: Hoare triple {5287#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {5305#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 00:15:09,271 INFO L280 TraceCheckUtils]: 30: Hoare triple {5305#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {5306#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:09,272 INFO L280 TraceCheckUtils]: 31: Hoare triple {5306#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:09,272 INFO L280 TraceCheckUtils]: 32: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:09,273 INFO L280 TraceCheckUtils]: 33: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:09,274 INFO L280 TraceCheckUtils]: 34: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,274 INFO L280 TraceCheckUtils]: 35: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,275 INFO L263 TraceCheckUtils]: 36: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5287#true} is VALID [2020-07-18 00:15:09,275 INFO L280 TraceCheckUtils]: 37: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,275 INFO L280 TraceCheckUtils]: 38: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,275 INFO L280 TraceCheckUtils]: 39: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,276 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,276 INFO L263 TraceCheckUtils]: 41: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {5287#true} is VALID [2020-07-18 00:15:09,276 INFO L280 TraceCheckUtils]: 42: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,276 INFO L280 TraceCheckUtils]: 43: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,277 INFO L280 TraceCheckUtils]: 44: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,277 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,278 INFO L280 TraceCheckUtils]: 46: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,279 INFO L280 TraceCheckUtils]: 47: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,280 INFO L280 TraceCheckUtils]: 48: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,280 INFO L280 TraceCheckUtils]: 49: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,281 INFO L280 TraceCheckUtils]: 50: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,282 INFO L280 TraceCheckUtils]: 51: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,282 INFO L280 TraceCheckUtils]: 52: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,297 INFO L280 TraceCheckUtils]: 53: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {5317#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,302 INFO L280 TraceCheckUtils]: 54: Hoare triple {5317#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,303 INFO L280 TraceCheckUtils]: 55: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,304 INFO L263 TraceCheckUtils]: 56: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {5319#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:09,305 INFO L280 TraceCheckUtils]: 57: Hoare triple {5319#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {5320#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:09,306 INFO L280 TraceCheckUtils]: 58: Hoare triple {5320#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,307 INFO L280 TraceCheckUtils]: 59: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,308 INFO L280 TraceCheckUtils]: 60: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,308 INFO L280 TraceCheckUtils]: 61: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,309 INFO L280 TraceCheckUtils]: 62: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,309 INFO L263 TraceCheckUtils]: 63: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5287#true} is VALID [2020-07-18 00:15:09,309 INFO L280 TraceCheckUtils]: 64: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,309 INFO L280 TraceCheckUtils]: 65: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,310 INFO L280 TraceCheckUtils]: 66: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,310 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,310 INFO L263 TraceCheckUtils]: 68: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {5287#true} is VALID [2020-07-18 00:15:09,310 INFO L280 TraceCheckUtils]: 69: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 00:15:09,311 INFO L280 TraceCheckUtils]: 70: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 00:15:09,311 INFO L280 TraceCheckUtils]: 71: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 00:15:09,311 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,312 INFO L280 TraceCheckUtils]: 73: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,312 INFO L280 TraceCheckUtils]: 74: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,313 INFO L280 TraceCheckUtils]: 75: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,313 INFO L280 TraceCheckUtils]: 76: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,314 INFO L280 TraceCheckUtils]: 77: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume #t~mem1 <= #t~mem2; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,314 INFO L280 TraceCheckUtils]: 78: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,315 INFO L280 TraceCheckUtils]: 79: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:09,316 INFO L280 TraceCheckUtils]: 80: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post3 := ~x; {5330#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:09,317 INFO L280 TraceCheckUtils]: 81: Hoare triple {5330#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:09,318 INFO L280 TraceCheckUtils]: 82: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~post3; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:09,319 INFO L263 TraceCheckUtils]: 83: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {5332#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:09,320 INFO L280 TraceCheckUtils]: 84: Hoare triple {5332#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {5333#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:09,320 INFO L280 TraceCheckUtils]: 85: Hoare triple {5333#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:09,321 INFO L280 TraceCheckUtils]: 86: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:09,321 INFO L280 TraceCheckUtils]: 87: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:09,322 INFO L280 TraceCheckUtils]: 88: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:09,323 INFO L280 TraceCheckUtils]: 89: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:09,323 INFO L263 TraceCheckUtils]: 90: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5335#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:15:09,324 INFO L280 TraceCheckUtils]: 91: Hoare triple {5335#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5336#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:15:09,324 INFO L280 TraceCheckUtils]: 92: Hoare triple {5336#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5288#false} is VALID [2020-07-18 00:15:09,324 INFO L280 TraceCheckUtils]: 93: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2020-07-18 00:15:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-18 00:15:09,335 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:15:09,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [797588167] [2020-07-18 00:15:09,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:15:09,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-18 00:15:09,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088100594] [2020-07-18 00:15:09,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 00:15:09,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:15:09,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 00:15:09,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:09,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 00:15:09,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:15:09,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 00:15:09,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:15:09,440 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-07-18 00:15:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:14,850 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-07-18 00:15:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-18 00:15:14,850 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 00:15:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:15:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:15:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2020-07-18 00:15:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:15:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2020-07-18 00:15:14,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 148 transitions. [2020-07-18 00:15:15,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:15,098 INFO L225 Difference]: With dead ends: 168 [2020-07-18 00:15:15,099 INFO L226 Difference]: Without dead ends: 166 [2020-07-18 00:15:15,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-07-18 00:15:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-18 00:15:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-07-18 00:15:15,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:15:15,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 119 states. [2020-07-18 00:15:15,476 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 119 states. [2020-07-18 00:15:15,476 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 119 states. [2020-07-18 00:15:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:15,483 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2020-07-18 00:15:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2020-07-18 00:15:15,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:15,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:15,484 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 166 states. [2020-07-18 00:15:15,484 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 166 states. [2020-07-18 00:15:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:15,490 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2020-07-18 00:15:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2020-07-18 00:15:15,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:15,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:15,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:15:15,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:15:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-18 00:15:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-07-18 00:15:15,496 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-07-18 00:15:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:15:15,496 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-07-18 00:15:15,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 00:15:15,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 128 transitions. [2020-07-18 00:15:15,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-07-18 00:15:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-18 00:15:15,764 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:15:15,765 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:15:15,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:15:15,765 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:15:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:15:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-07-18 00:15:15,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:15:15,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1260347835] [2020-07-18 00:15:15,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:15:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6294#true} is VALID [2020-07-18 00:15:16,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} #valid := #valid[0 := 0]; {6294#true} is VALID [2020-07-18 00:15:16,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume 0 < #StackHeapBarrier; {6294#true} is VALID [2020-07-18 00:15:16,203 INFO L280 TraceCheckUtils]: 3: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,203 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6294#true} {6294#true} #117#return; {6294#true} is VALID [2020-07-18 00:15:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,216 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,216 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6294#true} #99#return; {6294#true} is VALID [2020-07-18 00:15:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,220 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,220 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6294#true} #101#return; {6294#true} is VALID [2020-07-18 00:15:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {6345#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6294#true} is VALID [2020-07-18 00:15:16,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,256 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6294#true} {6294#true} #103#return; {6294#true} is VALID [2020-07-18 00:15:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,266 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,267 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,278 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,280 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,284 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,285 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,286 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:16,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,299 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,299 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,300 INFO L263 TraceCheckUtils]: 0: Hoare triple {6294#true} call ULTIMATE.init(); {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:15:16,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6294#true} is VALID [2020-07-18 00:15:16,301 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} #valid := #valid[0 := 0]; {6294#true} is VALID [2020-07-18 00:15:16,301 INFO L280 TraceCheckUtils]: 3: Hoare triple {6294#true} assume 0 < #StackHeapBarrier; {6294#true} is VALID [2020-07-18 00:15:16,301 INFO L280 TraceCheckUtils]: 4: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,301 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6294#true} {6294#true} #117#return; {6294#true} is VALID [2020-07-18 00:15:16,302 INFO L263 TraceCheckUtils]: 6: Hoare triple {6294#true} call #t~ret14 := main(); {6294#true} is VALID [2020-07-18 00:15:16,302 INFO L280 TraceCheckUtils]: 7: Hoare triple {6294#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6294#true} is VALID [2020-07-18 00:15:16,302 INFO L280 TraceCheckUtils]: 8: Hoare triple {6294#true} ~n~0 := #t~nondet8; {6294#true} is VALID [2020-07-18 00:15:16,302 INFO L280 TraceCheckUtils]: 9: Hoare triple {6294#true} havoc #t~nondet8; {6294#true} is VALID [2020-07-18 00:15:16,302 INFO L263 TraceCheckUtils]: 10: Hoare triple {6294#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {6294#true} is VALID [2020-07-18 00:15:16,303 INFO L280 TraceCheckUtils]: 11: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,303 INFO L280 TraceCheckUtils]: 12: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,303 INFO L280 TraceCheckUtils]: 13: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,303 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {6294#true} {6294#true} #99#return; {6294#true} is VALID [2020-07-18 00:15:16,303 INFO L280 TraceCheckUtils]: 15: Hoare triple {6294#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {6294#true} is VALID [2020-07-18 00:15:16,304 INFO L280 TraceCheckUtils]: 16: Hoare triple {6294#true} ~i~0 := #t~nondet9; {6294#true} is VALID [2020-07-18 00:15:16,304 INFO L280 TraceCheckUtils]: 17: Hoare triple {6294#true} havoc #t~nondet9; {6294#true} is VALID [2020-07-18 00:15:16,304 INFO L263 TraceCheckUtils]: 18: Hoare triple {6294#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {6294#true} is VALID [2020-07-18 00:15:16,304 INFO L280 TraceCheckUtils]: 19: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,304 INFO L280 TraceCheckUtils]: 20: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,305 INFO L280 TraceCheckUtils]: 21: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,305 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {6294#true} {6294#true} #101#return; {6294#true} is VALID [2020-07-18 00:15:16,305 INFO L280 TraceCheckUtils]: 23: Hoare triple {6294#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {6294#true} is VALID [2020-07-18 00:15:16,306 INFO L263 TraceCheckUtils]: 24: Hoare triple {6294#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {6345#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:15:16,307 INFO L280 TraceCheckUtils]: 25: Hoare triple {6345#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6294#true} is VALID [2020-07-18 00:15:16,307 INFO L280 TraceCheckUtils]: 26: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,307 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {6294#true} {6294#true} #103#return; {6294#true} is VALID [2020-07-18 00:15:16,307 INFO L280 TraceCheckUtils]: 28: Hoare triple {6294#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {6294#true} is VALID [2020-07-18 00:15:16,309 INFO L263 TraceCheckUtils]: 29: Hoare triple {6294#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {6312#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 00:15:16,309 INFO L280 TraceCheckUtils]: 30: Hoare triple {6312#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {6313#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:16,310 INFO L280 TraceCheckUtils]: 31: Hoare triple {6313#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:16,311 INFO L280 TraceCheckUtils]: 32: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:16,311 INFO L280 TraceCheckUtils]: 33: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:16,312 INFO L280 TraceCheckUtils]: 34: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,313 INFO L280 TraceCheckUtils]: 35: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,313 INFO L263 TraceCheckUtils]: 36: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6294#true} is VALID [2020-07-18 00:15:16,313 INFO L280 TraceCheckUtils]: 37: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,313 INFO L280 TraceCheckUtils]: 38: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,313 INFO L280 TraceCheckUtils]: 39: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,314 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,314 INFO L263 TraceCheckUtils]: 41: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {6294#true} is VALID [2020-07-18 00:15:16,314 INFO L280 TraceCheckUtils]: 42: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,315 INFO L280 TraceCheckUtils]: 43: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,315 INFO L280 TraceCheckUtils]: 44: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,315 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,316 INFO L280 TraceCheckUtils]: 46: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,317 INFO L280 TraceCheckUtils]: 47: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,317 INFO L280 TraceCheckUtils]: 48: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,318 INFO L280 TraceCheckUtils]: 49: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,319 INFO L280 TraceCheckUtils]: 50: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,319 INFO L280 TraceCheckUtils]: 51: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,320 INFO L280 TraceCheckUtils]: 52: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,322 INFO L280 TraceCheckUtils]: 53: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {6324#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:16,322 INFO L280 TraceCheckUtils]: 54: Hoare triple {6324#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,323 INFO L280 TraceCheckUtils]: 55: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,324 INFO L263 TraceCheckUtils]: 56: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {6326#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:16,325 INFO L280 TraceCheckUtils]: 57: Hoare triple {6326#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {6327#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:16,326 INFO L280 TraceCheckUtils]: 58: Hoare triple {6327#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,335 INFO L280 TraceCheckUtils]: 59: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,336 INFO L280 TraceCheckUtils]: 60: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,337 INFO L280 TraceCheckUtils]: 61: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,338 INFO L280 TraceCheckUtils]: 62: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,338 INFO L263 TraceCheckUtils]: 63: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6294#true} is VALID [2020-07-18 00:15:16,338 INFO L280 TraceCheckUtils]: 64: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,338 INFO L280 TraceCheckUtils]: 65: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,339 INFO L280 TraceCheckUtils]: 66: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,339 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,340 INFO L263 TraceCheckUtils]: 68: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {6294#true} is VALID [2020-07-18 00:15:16,340 INFO L280 TraceCheckUtils]: 69: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 00:15:16,340 INFO L280 TraceCheckUtils]: 70: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 00:15:16,340 INFO L280 TraceCheckUtils]: 71: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 00:15:16,341 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,342 INFO L280 TraceCheckUtils]: 73: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,343 INFO L280 TraceCheckUtils]: 74: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,344 INFO L280 TraceCheckUtils]: 75: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,345 INFO L280 TraceCheckUtils]: 76: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,345 INFO L280 TraceCheckUtils]: 77: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(#t~mem1 <= #t~mem2); {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,346 INFO L280 TraceCheckUtils]: 78: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,347 INFO L280 TraceCheckUtils]: 79: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:16,348 INFO L280 TraceCheckUtils]: 80: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post4 := ~y; {6337#(and (<= 1 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-18 00:15:16,349 INFO L280 TraceCheckUtils]: 81: Hoare triple {6337#(and (<= 1 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:16,350 INFO L280 TraceCheckUtils]: 82: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:16,352 INFO L263 TraceCheckUtils]: 83: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {6339#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:15:16,352 INFO L280 TraceCheckUtils]: 84: Hoare triple {6339#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {6340#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:15:16,353 INFO L280 TraceCheckUtils]: 85: Hoare triple {6340#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:16,354 INFO L280 TraceCheckUtils]: 86: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:16,354 INFO L280 TraceCheckUtils]: 87: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:16,355 INFO L280 TraceCheckUtils]: 88: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:16,356 INFO L280 TraceCheckUtils]: 89: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:16,357 INFO L263 TraceCheckUtils]: 90: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6342#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:15:16,358 INFO L280 TraceCheckUtils]: 91: Hoare triple {6342#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6343#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:15:16,358 INFO L280 TraceCheckUtils]: 92: Hoare triple {6343#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6295#false} is VALID [2020-07-18 00:15:16,358 INFO L280 TraceCheckUtils]: 93: Hoare triple {6295#false} assume !false; {6295#false} is VALID [2020-07-18 00:15:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-18 00:15:16,377 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:15:16,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1260347835] [2020-07-18 00:15:16,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:15:16,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-18 00:15:16,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648263903] [2020-07-18 00:15:16,382 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 00:15:16,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:15:16,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 00:15:16,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:16,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 00:15:16,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:15:16,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 00:15:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:15:16,497 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-07-18 00:15:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:22,790 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-07-18 00:15:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-18 00:15:22,790 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 00:15:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:15:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:15:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-18 00:15:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:15:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-18 00:15:22,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 148 transitions. [2020-07-18 00:15:23,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:23,036 INFO L225 Difference]: With dead ends: 191 [2020-07-18 00:15:23,036 INFO L226 Difference]: Without dead ends: 189 [2020-07-18 00:15:23,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2020-07-18 00:15:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-18 00:15:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-07-18 00:15:23,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:15:23,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 142 states. [2020-07-18 00:15:23,517 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 142 states. [2020-07-18 00:15:23,517 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 142 states. [2020-07-18 00:15:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:23,524 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2020-07-18 00:15:23,524 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2020-07-18 00:15:23,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:23,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:23,526 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 189 states. [2020-07-18 00:15:23,526 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 189 states. [2020-07-18 00:15:23,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:23,533 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2020-07-18 00:15:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2020-07-18 00:15:23,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:23,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:23,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:15:23,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:15:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-18 00:15:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-07-18 00:15:23,539 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-07-18 00:15:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:15:23,540 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-07-18 00:15:23,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 00:15:23,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 153 transitions. [2020-07-18 00:15:23,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-18 00:15:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-18 00:15:23,927 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:15:23,927 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:15:23,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:15:23,928 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:15:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:15:23,928 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-07-18 00:15:23,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:15:23,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [862311144] [2020-07-18 00:15:23,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:15:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7443#true} is VALID [2020-07-18 00:15:24,352 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} #valid := #valid[0 := 0]; {7443#true} is VALID [2020-07-18 00:15:24,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume 0 < #StackHeapBarrier; {7443#true} is VALID [2020-07-18 00:15:24,353 INFO L280 TraceCheckUtils]: 3: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,353 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7443#true} {7443#true} #117#return; {7443#true} is VALID [2020-07-18 00:15:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,356 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #99#return; {7443#true} is VALID [2020-07-18 00:15:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,364 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,364 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #101#return; {7443#true} is VALID [2020-07-18 00:15:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {7494#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7443#true} is VALID [2020-07-18 00:15:24,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,394 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7443#true} {7443#true} #103#return; {7443#true} is VALID [2020-07-18 00:15:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,400 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,401 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,411 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,412 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,418 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #109#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:24,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,427 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #111#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,428 INFO L263 TraceCheckUtils]: 0: Hoare triple {7443#true} call ULTIMATE.init(); {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:15:24,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7443#true} is VALID [2020-07-18 00:15:24,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} #valid := #valid[0 := 0]; {7443#true} is VALID [2020-07-18 00:15:24,429 INFO L280 TraceCheckUtils]: 3: Hoare triple {7443#true} assume 0 < #StackHeapBarrier; {7443#true} is VALID [2020-07-18 00:15:24,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,429 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7443#true} {7443#true} #117#return; {7443#true} is VALID [2020-07-18 00:15:24,429 INFO L263 TraceCheckUtils]: 6: Hoare triple {7443#true} call #t~ret14 := main(); {7443#true} is VALID [2020-07-18 00:15:24,430 INFO L280 TraceCheckUtils]: 7: Hoare triple {7443#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {7443#true} is VALID [2020-07-18 00:15:24,430 INFO L280 TraceCheckUtils]: 8: Hoare triple {7443#true} ~n~0 := #t~nondet8; {7443#true} is VALID [2020-07-18 00:15:24,430 INFO L280 TraceCheckUtils]: 9: Hoare triple {7443#true} havoc #t~nondet8; {7443#true} is VALID [2020-07-18 00:15:24,430 INFO L263 TraceCheckUtils]: 10: Hoare triple {7443#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {7443#true} is VALID [2020-07-18 00:15:24,430 INFO L280 TraceCheckUtils]: 11: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,431 INFO L280 TraceCheckUtils]: 12: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,431 INFO L280 TraceCheckUtils]: 13: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,431 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7443#true} {7443#true} #99#return; {7443#true} is VALID [2020-07-18 00:15:24,431 INFO L280 TraceCheckUtils]: 15: Hoare triple {7443#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {7443#true} is VALID [2020-07-18 00:15:24,431 INFO L280 TraceCheckUtils]: 16: Hoare triple {7443#true} ~i~0 := #t~nondet9; {7443#true} is VALID [2020-07-18 00:15:24,431 INFO L280 TraceCheckUtils]: 17: Hoare triple {7443#true} havoc #t~nondet9; {7443#true} is VALID [2020-07-18 00:15:24,432 INFO L263 TraceCheckUtils]: 18: Hoare triple {7443#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {7443#true} is VALID [2020-07-18 00:15:24,432 INFO L280 TraceCheckUtils]: 19: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,432 INFO L280 TraceCheckUtils]: 20: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,432 INFO L280 TraceCheckUtils]: 21: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,432 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {7443#true} {7443#true} #101#return; {7443#true} is VALID [2020-07-18 00:15:24,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {7443#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {7443#true} is VALID [2020-07-18 00:15:24,434 INFO L263 TraceCheckUtils]: 24: Hoare triple {7443#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {7494#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:15:24,434 INFO L280 TraceCheckUtils]: 25: Hoare triple {7494#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7443#true} is VALID [2020-07-18 00:15:24,434 INFO L280 TraceCheckUtils]: 26: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,434 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7443#true} {7443#true} #103#return; {7443#true} is VALID [2020-07-18 00:15:24,435 INFO L280 TraceCheckUtils]: 28: Hoare triple {7443#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {7443#true} is VALID [2020-07-18 00:15:24,436 INFO L263 TraceCheckUtils]: 29: Hoare triple {7443#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {7461#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 00:15:24,437 INFO L280 TraceCheckUtils]: 30: Hoare triple {7461#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {7462#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:24,438 INFO L280 TraceCheckUtils]: 31: Hoare triple {7462#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:24,438 INFO L280 TraceCheckUtils]: 32: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:24,439 INFO L280 TraceCheckUtils]: 33: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:24,440 INFO L280 TraceCheckUtils]: 34: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,440 INFO L280 TraceCheckUtils]: 35: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,441 INFO L263 TraceCheckUtils]: 36: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7443#true} is VALID [2020-07-18 00:15:24,441 INFO L280 TraceCheckUtils]: 37: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,441 INFO L280 TraceCheckUtils]: 38: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,441 INFO L280 TraceCheckUtils]: 39: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,442 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,442 INFO L263 TraceCheckUtils]: 41: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {7443#true} is VALID [2020-07-18 00:15:24,442 INFO L280 TraceCheckUtils]: 42: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,443 INFO L280 TraceCheckUtils]: 43: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,443 INFO L280 TraceCheckUtils]: 44: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,444 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,444 INFO L280 TraceCheckUtils]: 46: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,445 INFO L280 TraceCheckUtils]: 47: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,446 INFO L280 TraceCheckUtils]: 48: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,447 INFO L280 TraceCheckUtils]: 49: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,447 INFO L280 TraceCheckUtils]: 50: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(#t~mem1 <= #t~mem2); {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,448 INFO L280 TraceCheckUtils]: 51: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,449 INFO L280 TraceCheckUtils]: 52: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:24,449 INFO L280 TraceCheckUtils]: 53: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post4 := ~y; {7473#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-18 00:15:24,450 INFO L280 TraceCheckUtils]: 54: Hoare triple {7473#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,451 INFO L280 TraceCheckUtils]: 55: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,452 INFO L263 TraceCheckUtils]: 56: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {7475#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,453 INFO L280 TraceCheckUtils]: 57: Hoare triple {7475#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {7476#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,454 INFO L280 TraceCheckUtils]: 58: Hoare triple {7476#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,455 INFO L280 TraceCheckUtils]: 59: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,455 INFO L280 TraceCheckUtils]: 60: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,456 INFO L280 TraceCheckUtils]: 61: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,457 INFO L280 TraceCheckUtils]: 62: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,457 INFO L263 TraceCheckUtils]: 63: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7443#true} is VALID [2020-07-18 00:15:24,457 INFO L280 TraceCheckUtils]: 64: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,457 INFO L280 TraceCheckUtils]: 65: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,458 INFO L280 TraceCheckUtils]: 66: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,458 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #109#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,459 INFO L263 TraceCheckUtils]: 68: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {7443#true} is VALID [2020-07-18 00:15:24,459 INFO L280 TraceCheckUtils]: 69: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 00:15:24,459 INFO L280 TraceCheckUtils]: 70: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 00:15:24,459 INFO L280 TraceCheckUtils]: 71: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 00:15:24,460 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #111#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,461 INFO L280 TraceCheckUtils]: 73: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} ~x0~0 := ~x; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,461 INFO L280 TraceCheckUtils]: 74: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} ~y0~0 := ~y; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,462 INFO L280 TraceCheckUtils]: 75: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,463 INFO L280 TraceCheckUtils]: 76: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,464 INFO L280 TraceCheckUtils]: 77: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume #t~mem1 <= #t~mem2; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,464 INFO L280 TraceCheckUtils]: 78: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~mem1; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,465 INFO L280 TraceCheckUtils]: 79: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~mem2; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,466 INFO L280 TraceCheckUtils]: 80: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #t~post3 := ~x; {7486#(and (= 0 |check_#t~post3|) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,466 INFO L280 TraceCheckUtils]: 81: Hoare triple {7486#(and (= 0 |check_#t~post3|) (<= (+ check_~y 2) check_~n))} ~x := 1 + #t~post3; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,467 INFO L280 TraceCheckUtils]: 82: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post3; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,468 INFO L263 TraceCheckUtils]: 83: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {7488#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,469 INFO L280 TraceCheckUtils]: 84: Hoare triple {7488#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {7489#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,470 INFO L280 TraceCheckUtils]: 85: Hoare triple {7489#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,471 INFO L280 TraceCheckUtils]: 86: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,471 INFO L280 TraceCheckUtils]: 87: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 00:15:24,472 INFO L280 TraceCheckUtils]: 88: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,473 INFO L280 TraceCheckUtils]: 89: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 00:15:24,474 INFO L263 TraceCheckUtils]: 90: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7491#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:15:24,474 INFO L280 TraceCheckUtils]: 91: Hoare triple {7491#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7492#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:15:24,475 INFO L280 TraceCheckUtils]: 92: Hoare triple {7492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7444#false} is VALID [2020-07-18 00:15:24,475 INFO L280 TraceCheckUtils]: 93: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2020-07-18 00:15:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-18 00:15:24,489 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:15:24,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [862311144] [2020-07-18 00:15:24,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:15:24,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-18 00:15:24,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262357192] [2020-07-18 00:15:24,491 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 00:15:24,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:15:24,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 00:15:24,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:24,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 00:15:24,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:15:24,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 00:15:24,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-18 00:15:24,597 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-07-18 00:15:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:30,436 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-07-18 00:15:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-18 00:15:30,437 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 00:15:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:15:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:15:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-18 00:15:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:15:30,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-18 00:15:30,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 148 transitions. [2020-07-18 00:15:30,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:30,707 INFO L225 Difference]: With dead ends: 208 [2020-07-18 00:15:30,707 INFO L226 Difference]: Without dead ends: 206 [2020-07-18 00:15:30,708 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-07-18 00:15:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-18 00:15:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-07-18 00:15:31,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:15:31,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 182 states. [2020-07-18 00:15:31,384 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 182 states. [2020-07-18 00:15:31,384 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 182 states. [2020-07-18 00:15:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:31,391 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2020-07-18 00:15:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2020-07-18 00:15:31,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:31,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:31,392 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 206 states. [2020-07-18 00:15:31,393 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 206 states. [2020-07-18 00:15:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:31,398 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2020-07-18 00:15:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2020-07-18 00:15:31,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:31,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:31,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:15:31,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:15:31,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-18 00:15:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-07-18 00:15:31,405 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-07-18 00:15:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:15:31,405 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-07-18 00:15:31,405 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 00:15:31,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 182 states and 195 transitions. [2020-07-18 00:15:31,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:31,868 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-07-18 00:15:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-18 00:15:31,870 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:15:31,870 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:15:31,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:15:31,871 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:15:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:15:31,871 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-07-18 00:15:31,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:15:31,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739759643] [2020-07-18 00:15:31,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:15:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8741#true} is VALID [2020-07-18 00:15:32,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} #valid := #valid[0 := 0]; {8741#true} is VALID [2020-07-18 00:15:32,528 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume 0 < #StackHeapBarrier; {8741#true} is VALID [2020-07-18 00:15:32,528 INFO L280 TraceCheckUtils]: 3: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,529 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8741#true} {8741#true} #117#return; {8741#true} is VALID [2020-07-18 00:15:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,537 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8741#true} #99#return; {8741#true} is VALID [2020-07-18 00:15:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,541 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8741#true} #101#return; {8741#true} is VALID [2020-07-18 00:15:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {8805#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8741#true} is VALID [2020-07-18 00:15:32,571 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,571 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8741#true} {8741#true} #103#return; {8741#true} is VALID [2020-07-18 00:15:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,575 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,575 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,584 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,586 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,591 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,596 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,597 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,602 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #109#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:32,606 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,607 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #111#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {8741#true} call ULTIMATE.init(); {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:15:32,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8741#true} is VALID [2020-07-18 00:15:32,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} #valid := #valid[0 := 0]; {8741#true} is VALID [2020-07-18 00:15:32,609 INFO L280 TraceCheckUtils]: 3: Hoare triple {8741#true} assume 0 < #StackHeapBarrier; {8741#true} is VALID [2020-07-18 00:15:32,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,609 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8741#true} {8741#true} #117#return; {8741#true} is VALID [2020-07-18 00:15:32,609 INFO L263 TraceCheckUtils]: 6: Hoare triple {8741#true} call #t~ret14 := main(); {8741#true} is VALID [2020-07-18 00:15:32,610 INFO L280 TraceCheckUtils]: 7: Hoare triple {8741#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8741#true} is VALID [2020-07-18 00:15:32,610 INFO L280 TraceCheckUtils]: 8: Hoare triple {8741#true} ~n~0 := #t~nondet8; {8741#true} is VALID [2020-07-18 00:15:32,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {8741#true} havoc #t~nondet8; {8741#true} is VALID [2020-07-18 00:15:32,610 INFO L263 TraceCheckUtils]: 10: Hoare triple {8741#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {8741#true} is VALID [2020-07-18 00:15:32,610 INFO L280 TraceCheckUtils]: 11: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,611 INFO L280 TraceCheckUtils]: 13: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,611 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {8741#true} {8741#true} #99#return; {8741#true} is VALID [2020-07-18 00:15:32,611 INFO L280 TraceCheckUtils]: 15: Hoare triple {8741#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {8741#true} is VALID [2020-07-18 00:15:32,611 INFO L280 TraceCheckUtils]: 16: Hoare triple {8741#true} ~i~0 := #t~nondet9; {8741#true} is VALID [2020-07-18 00:15:32,611 INFO L280 TraceCheckUtils]: 17: Hoare triple {8741#true} havoc #t~nondet9; {8741#true} is VALID [2020-07-18 00:15:32,612 INFO L263 TraceCheckUtils]: 18: Hoare triple {8741#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {8741#true} is VALID [2020-07-18 00:15:32,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,612 INFO L280 TraceCheckUtils]: 20: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,612 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {8741#true} {8741#true} #101#return; {8741#true} is VALID [2020-07-18 00:15:32,613 INFO L280 TraceCheckUtils]: 23: Hoare triple {8741#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {8741#true} is VALID [2020-07-18 00:15:32,614 INFO L263 TraceCheckUtils]: 24: Hoare triple {8741#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {8805#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:15:32,614 INFO L280 TraceCheckUtils]: 25: Hoare triple {8805#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8741#true} is VALID [2020-07-18 00:15:32,614 INFO L280 TraceCheckUtils]: 26: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,614 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8741#true} {8741#true} #103#return; {8741#true} is VALID [2020-07-18 00:15:32,614 INFO L280 TraceCheckUtils]: 28: Hoare triple {8741#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {8741#true} is VALID [2020-07-18 00:15:32,616 INFO L263 TraceCheckUtils]: 29: Hoare triple {8741#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {8759#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 00:15:32,616 INFO L280 TraceCheckUtils]: 30: Hoare triple {8759#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {8760#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:32,617 INFO L280 TraceCheckUtils]: 31: Hoare triple {8760#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:32,618 INFO L280 TraceCheckUtils]: 32: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:32,618 INFO L280 TraceCheckUtils]: 33: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 00:15:32,619 INFO L280 TraceCheckUtils]: 34: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,620 INFO L280 TraceCheckUtils]: 35: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,620 INFO L263 TraceCheckUtils]: 36: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 00:15:32,620 INFO L280 TraceCheckUtils]: 37: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,620 INFO L280 TraceCheckUtils]: 38: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,621 INFO L280 TraceCheckUtils]: 39: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,622 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,622 INFO L263 TraceCheckUtils]: 41: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 00:15:32,622 INFO L280 TraceCheckUtils]: 42: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,622 INFO L280 TraceCheckUtils]: 43: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,622 INFO L280 TraceCheckUtils]: 44: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,627 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,627 INFO L280 TraceCheckUtils]: 46: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,628 INFO L280 TraceCheckUtils]: 47: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,628 INFO L280 TraceCheckUtils]: 48: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,629 INFO L280 TraceCheckUtils]: 49: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,629 INFO L280 TraceCheckUtils]: 50: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,630 INFO L280 TraceCheckUtils]: 51: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,637 INFO L280 TraceCheckUtils]: 52: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,638 INFO L280 TraceCheckUtils]: 53: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {8771#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,639 INFO L280 TraceCheckUtils]: 54: Hoare triple {8771#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,639 INFO L280 TraceCheckUtils]: 55: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,640 INFO L263 TraceCheckUtils]: 56: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8773#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:32,641 INFO L280 TraceCheckUtils]: 57: Hoare triple {8773#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {8774#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:32,642 INFO L280 TraceCheckUtils]: 58: Hoare triple {8774#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,642 INFO L280 TraceCheckUtils]: 59: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,643 INFO L280 TraceCheckUtils]: 60: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,643 INFO L280 TraceCheckUtils]: 61: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,644 INFO L280 TraceCheckUtils]: 62: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,644 INFO L263 TraceCheckUtils]: 63: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 00:15:32,644 INFO L280 TraceCheckUtils]: 64: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,644 INFO L280 TraceCheckUtils]: 65: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,644 INFO L280 TraceCheckUtils]: 66: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,645 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,645 INFO L263 TraceCheckUtils]: 68: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 00:15:32,645 INFO L280 TraceCheckUtils]: 69: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,645 INFO L280 TraceCheckUtils]: 70: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,645 INFO L280 TraceCheckUtils]: 71: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,646 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,646 INFO L280 TraceCheckUtils]: 73: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,647 INFO L280 TraceCheckUtils]: 74: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,647 INFO L280 TraceCheckUtils]: 75: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,648 INFO L280 TraceCheckUtils]: 76: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,648 INFO L280 TraceCheckUtils]: 77: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume #t~mem1 <= #t~mem2; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,649 INFO L280 TraceCheckUtils]: 78: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,651 INFO L280 TraceCheckUtils]: 79: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 00:15:32,654 INFO L280 TraceCheckUtils]: 80: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post3 := ~x; {8784#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 00:15:32,656 INFO L280 TraceCheckUtils]: 81: Hoare triple {8784#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,657 INFO L280 TraceCheckUtils]: 82: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~post3; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,657 INFO L263 TraceCheckUtils]: 83: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8786#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 00:15:32,658 INFO L280 TraceCheckUtils]: 84: Hoare triple {8786#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {8787#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,659 INFO L280 TraceCheckUtils]: 85: Hoare triple {8787#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,659 INFO L280 TraceCheckUtils]: 86: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,660 INFO L280 TraceCheckUtils]: 87: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,660 INFO L280 TraceCheckUtils]: 88: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,661 INFO L280 TraceCheckUtils]: 89: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,661 INFO L263 TraceCheckUtils]: 90: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 00:15:32,661 INFO L280 TraceCheckUtils]: 91: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,661 INFO L280 TraceCheckUtils]: 92: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,661 INFO L280 TraceCheckUtils]: 93: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,662 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #109#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,662 INFO L263 TraceCheckUtils]: 95: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 00:15:32,662 INFO L280 TraceCheckUtils]: 96: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 00:15:32,662 INFO L280 TraceCheckUtils]: 97: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 00:15:32,662 INFO L280 TraceCheckUtils]: 98: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 00:15:32,663 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #111#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,663 INFO L280 TraceCheckUtils]: 100: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} ~x0~0 := ~x; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,664 INFO L280 TraceCheckUtils]: 101: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} ~y0~0 := ~y; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,664 INFO L280 TraceCheckUtils]: 102: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,665 INFO L280 TraceCheckUtils]: 103: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,667 INFO L280 TraceCheckUtils]: 104: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(#t~mem1 <= #t~mem2); {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,668 INFO L280 TraceCheckUtils]: 105: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~mem1; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,673 INFO L280 TraceCheckUtils]: 106: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~mem2; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,673 INFO L280 TraceCheckUtils]: 107: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #t~post4 := ~y; {8797#(and (<= (+ |check_#t~post4| 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,674 INFO L280 TraceCheckUtils]: 108: Hoare triple {8797#(and (<= (+ |check_#t~post4| 1) check_~n) (<= 2 check_~x))} ~y := #t~post4 - 1; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,675 INFO L280 TraceCheckUtils]: 109: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} havoc #t~post4; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,676 INFO L263 TraceCheckUtils]: 110: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8799#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 00:15:32,677 INFO L280 TraceCheckUtils]: 111: Hoare triple {8799#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {8800#(and (<= (+ |check_#in~y| 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,678 INFO L280 TraceCheckUtils]: 112: Hoare triple {8800#(and (<= (+ |check_#in~y| 2) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,679 INFO L280 TraceCheckUtils]: 113: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,679 INFO L280 TraceCheckUtils]: 114: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,680 INFO L280 TraceCheckUtils]: 115: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,681 INFO L280 TraceCheckUtils]: 116: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 00:15:32,682 INFO L263 TraceCheckUtils]: 117: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8802#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:15:32,683 INFO L280 TraceCheckUtils]: 118: Hoare triple {8802#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8803#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:15:32,683 INFO L280 TraceCheckUtils]: 119: Hoare triple {8803#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8742#false} is VALID [2020-07-18 00:15:32,683 INFO L280 TraceCheckUtils]: 120: Hoare triple {8742#false} assume !false; {8742#false} is VALID [2020-07-18 00:15:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-18 00:15:32,706 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:15:32,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739759643] [2020-07-18 00:15:32,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:15:32,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-07-18 00:15:32,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403785534] [2020-07-18 00:15:32,707 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-18 00:15:32,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:15:32,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2020-07-18 00:15:32,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:32,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-18 00:15:32,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:15:32,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-18 00:15:32,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-18 00:15:32,844 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-07-18 00:15:41,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:41,441 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-07-18 00:15:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-18 00:15:41,441 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-18 00:15:41,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:15:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 00:15:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 176 transitions. [2020-07-18 00:15:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 00:15:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 176 transitions. [2020-07-18 00:15:41,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 176 transitions. [2020-07-18 00:15:41,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:41,822 INFO L225 Difference]: With dead ends: 237 [2020-07-18 00:15:41,823 INFO L226 Difference]: Without dead ends: 171 [2020-07-18 00:15:41,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-07-18 00:15:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-18 00:15:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-07-18 00:15:42,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:15:42,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 159 states. [2020-07-18 00:15:42,458 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 159 states. [2020-07-18 00:15:42,458 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 159 states. [2020-07-18 00:15:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:42,464 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2020-07-18 00:15:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2020-07-18 00:15:42,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:42,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:42,465 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 171 states. [2020-07-18 00:15:42,466 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 171 states. [2020-07-18 00:15:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:15:42,471 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2020-07-18 00:15:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2020-07-18 00:15:42,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:15:42,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:15:42,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:15:42,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:15:42,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-18 00:15:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-18 00:15:42,476 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-07-18 00:15:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:15:42,477 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-18 00:15:42,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-18 00:15:42,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 169 transitions. [2020-07-18 00:15:42,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:15:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-18 00:15:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-18 00:15:42,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:15:42,894 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:15:42,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:15:42,894 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:15:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:15:42,894 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-07-18 00:15:42,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:15:42,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [392076879] [2020-07-18 00:15:42,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:15:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10011#true} is VALID [2020-07-18 00:15:43,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} #valid := #valid[0 := 0]; {10011#true} is VALID [2020-07-18 00:15:43,062 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume 0 < #StackHeapBarrier; {10011#true} is VALID [2020-07-18 00:15:43,062 INFO L280 TraceCheckUtils]: 3: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,062 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10011#true} {10011#true} #117#return; {10011#true} is VALID [2020-07-18 00:15:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,067 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,068 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10011#true} #99#return; {10011#true} is VALID [2020-07-18 00:15:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,071 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,072 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10011#true} #101#return; {10011#true} is VALID [2020-07-18 00:15:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {10060#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:15:43,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:15:43,104 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {10011#true} #103#return; {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 00:15:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,108 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,109 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,113 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,113 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,114 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,120 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,121 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,125 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,129 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10012#false} #109#return; {10012#false} is VALID [2020-07-18 00:15:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:15:43,132 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,133 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10012#false} #111#return; {10012#false} is VALID [2020-07-18 00:15:43,135 INFO L263 TraceCheckUtils]: 0: Hoare triple {10011#true} call ULTIMATE.init(); {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:15:43,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10011#true} is VALID [2020-07-18 00:15:43,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} #valid := #valid[0 := 0]; {10011#true} is VALID [2020-07-18 00:15:43,135 INFO L280 TraceCheckUtils]: 3: Hoare triple {10011#true} assume 0 < #StackHeapBarrier; {10011#true} is VALID [2020-07-18 00:15:43,135 INFO L280 TraceCheckUtils]: 4: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,136 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10011#true} {10011#true} #117#return; {10011#true} is VALID [2020-07-18 00:15:43,136 INFO L263 TraceCheckUtils]: 6: Hoare triple {10011#true} call #t~ret14 := main(); {10011#true} is VALID [2020-07-18 00:15:43,136 INFO L280 TraceCheckUtils]: 7: Hoare triple {10011#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10011#true} is VALID [2020-07-18 00:15:43,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {10011#true} ~n~0 := #t~nondet8; {10011#true} is VALID [2020-07-18 00:15:43,136 INFO L280 TraceCheckUtils]: 9: Hoare triple {10011#true} havoc #t~nondet8; {10011#true} is VALID [2020-07-18 00:15:43,137 INFO L263 TraceCheckUtils]: 10: Hoare triple {10011#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {10011#true} is VALID [2020-07-18 00:15:43,137 INFO L280 TraceCheckUtils]: 11: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,137 INFO L280 TraceCheckUtils]: 12: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,137 INFO L280 TraceCheckUtils]: 13: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,138 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {10011#true} {10011#true} #99#return; {10011#true} is VALID [2020-07-18 00:15:43,138 INFO L280 TraceCheckUtils]: 15: Hoare triple {10011#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {10011#true} is VALID [2020-07-18 00:15:43,138 INFO L280 TraceCheckUtils]: 16: Hoare triple {10011#true} ~i~0 := #t~nondet9; {10011#true} is VALID [2020-07-18 00:15:43,138 INFO L280 TraceCheckUtils]: 17: Hoare triple {10011#true} havoc #t~nondet9; {10011#true} is VALID [2020-07-18 00:15:43,138 INFO L263 TraceCheckUtils]: 18: Hoare triple {10011#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {10011#true} is VALID [2020-07-18 00:15:43,139 INFO L280 TraceCheckUtils]: 19: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,139 INFO L280 TraceCheckUtils]: 20: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,139 INFO L280 TraceCheckUtils]: 21: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,139 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {10011#true} {10011#true} #101#return; {10011#true} is VALID [2020-07-18 00:15:43,139 INFO L280 TraceCheckUtils]: 23: Hoare triple {10011#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {10011#true} is VALID [2020-07-18 00:15:43,141 INFO L263 TraceCheckUtils]: 24: Hoare triple {10011#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {10060#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 00:15:43,142 INFO L280 TraceCheckUtils]: 25: Hoare triple {10060#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:15:43,143 INFO L280 TraceCheckUtils]: 26: Hoare triple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 00:15:43,144 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {10011#true} #103#return; {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 00:15:43,145 INFO L280 TraceCheckUtils]: 28: Hoare triple {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {10030#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 00:15:43,147 INFO L263 TraceCheckUtils]: 29: Hoare triple {10030#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:43,147 INFO L280 TraceCheckUtils]: 30: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:43,148 INFO L280 TraceCheckUtils]: 31: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:43,149 INFO L280 TraceCheckUtils]: 32: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,149 INFO L280 TraceCheckUtils]: 33: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,150 INFO L280 TraceCheckUtils]: 34: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,151 INFO L280 TraceCheckUtils]: 35: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,151 INFO L263 TraceCheckUtils]: 36: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 00:15:43,151 INFO L280 TraceCheckUtils]: 37: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,152 INFO L280 TraceCheckUtils]: 38: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,152 INFO L280 TraceCheckUtils]: 39: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,153 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,153 INFO L263 TraceCheckUtils]: 41: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 00:15:43,153 INFO L280 TraceCheckUtils]: 42: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,153 INFO L280 TraceCheckUtils]: 43: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,153 INFO L280 TraceCheckUtils]: 44: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,154 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,155 INFO L280 TraceCheckUtils]: 46: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,155 INFO L280 TraceCheckUtils]: 47: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,156 INFO L280 TraceCheckUtils]: 48: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,156 INFO L280 TraceCheckUtils]: 49: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,157 INFO L280 TraceCheckUtils]: 50: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,158 INFO L280 TraceCheckUtils]: 51: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem1; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,159 INFO L280 TraceCheckUtils]: 52: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem2; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,160 INFO L280 TraceCheckUtils]: 53: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #t~post3 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,161 INFO L280 TraceCheckUtils]: 54: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x := 1 + #t~post3; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,162 INFO L280 TraceCheckUtils]: 55: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~post3; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,163 INFO L263 TraceCheckUtils]: 56: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:43,163 INFO L280 TraceCheckUtils]: 57: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:43,164 INFO L280 TraceCheckUtils]: 58: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 00:15:43,165 INFO L280 TraceCheckUtils]: 59: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,165 INFO L280 TraceCheckUtils]: 60: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,166 INFO L280 TraceCheckUtils]: 61: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,166 INFO L280 TraceCheckUtils]: 62: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,167 INFO L263 TraceCheckUtils]: 63: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 00:15:43,167 INFO L280 TraceCheckUtils]: 64: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,167 INFO L280 TraceCheckUtils]: 65: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,167 INFO L280 TraceCheckUtils]: 66: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,168 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,168 INFO L263 TraceCheckUtils]: 68: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 00:15:43,169 INFO L280 TraceCheckUtils]: 69: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,169 INFO L280 TraceCheckUtils]: 70: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,169 INFO L280 TraceCheckUtils]: 71: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,170 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,171 INFO L280 TraceCheckUtils]: 73: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,171 INFO L280 TraceCheckUtils]: 74: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 00:15:43,172 INFO L280 TraceCheckUtils]: 75: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10049#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem1|))} is VALID [2020-07-18 00:15:43,173 INFO L280 TraceCheckUtils]: 76: Hoare triple {10049#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem1|))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10050#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} is VALID [2020-07-18 00:15:43,173 INFO L280 TraceCheckUtils]: 77: Hoare triple {10050#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} assume !(#t~mem1 <= #t~mem2); {10012#false} is VALID [2020-07-18 00:15:43,173 INFO L280 TraceCheckUtils]: 78: Hoare triple {10012#false} havoc #t~mem1; {10012#false} is VALID [2020-07-18 00:15:43,174 INFO L280 TraceCheckUtils]: 79: Hoare triple {10012#false} havoc #t~mem2; {10012#false} is VALID [2020-07-18 00:15:43,174 INFO L280 TraceCheckUtils]: 80: Hoare triple {10012#false} #t~post4 := ~y; {10012#false} is VALID [2020-07-18 00:15:43,174 INFO L280 TraceCheckUtils]: 81: Hoare triple {10012#false} ~y := #t~post4 - 1; {10012#false} is VALID [2020-07-18 00:15:43,174 INFO L280 TraceCheckUtils]: 82: Hoare triple {10012#false} havoc #t~post4; {10012#false} is VALID [2020-07-18 00:15:43,174 INFO L263 TraceCheckUtils]: 83: Hoare triple {10012#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10012#false} is VALID [2020-07-18 00:15:43,175 INFO L280 TraceCheckUtils]: 84: Hoare triple {10012#false} ~x := #in~x; {10012#false} is VALID [2020-07-18 00:15:43,175 INFO L280 TraceCheckUtils]: 85: Hoare triple {10012#false} ~y := #in~y; {10012#false} is VALID [2020-07-18 00:15:43,175 INFO L280 TraceCheckUtils]: 86: Hoare triple {10012#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10012#false} is VALID [2020-07-18 00:15:43,175 INFO L280 TraceCheckUtils]: 87: Hoare triple {10012#false} ~i := #in~i; {10012#false} is VALID [2020-07-18 00:15:43,175 INFO L280 TraceCheckUtils]: 88: Hoare triple {10012#false} ~n := #in~n; {10012#false} is VALID [2020-07-18 00:15:43,176 INFO L280 TraceCheckUtils]: 89: Hoare triple {10012#false} assume !(~x >= ~y); {10012#false} is VALID [2020-07-18 00:15:43,176 INFO L263 TraceCheckUtils]: 90: Hoare triple {10012#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 00:15:43,176 INFO L280 TraceCheckUtils]: 91: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,176 INFO L280 TraceCheckUtils]: 92: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,176 INFO L280 TraceCheckUtils]: 93: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,177 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {10011#true} {10012#false} #109#return; {10012#false} is VALID [2020-07-18 00:15:43,177 INFO L263 TraceCheckUtils]: 95: Hoare triple {10012#false} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 00:15:43,177 INFO L280 TraceCheckUtils]: 96: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 00:15:43,177 INFO L280 TraceCheckUtils]: 97: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 00:15:43,178 INFO L280 TraceCheckUtils]: 98: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 00:15:43,178 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {10011#true} {10012#false} #111#return; {10012#false} is VALID [2020-07-18 00:15:43,178 INFO L280 TraceCheckUtils]: 100: Hoare triple {10012#false} ~x0~0 := ~x; {10012#false} is VALID [2020-07-18 00:15:43,178 INFO L280 TraceCheckUtils]: 101: Hoare triple {10012#false} ~y0~0 := ~y; {10012#false} is VALID [2020-07-18 00:15:43,179 INFO L280 TraceCheckUtils]: 102: Hoare triple {10012#false} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10012#false} is VALID [2020-07-18 00:15:43,179 INFO L280 TraceCheckUtils]: 103: Hoare triple {10012#false} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10012#false} is VALID [2020-07-18 00:15:43,179 INFO L280 TraceCheckUtils]: 104: Hoare triple {10012#false} assume #t~mem1 <= #t~mem2; {10012#false} is VALID [2020-07-18 00:15:43,179 INFO L280 TraceCheckUtils]: 105: Hoare triple {10012#false} havoc #t~mem1; {10012#false} is VALID [2020-07-18 00:15:43,179 INFO L280 TraceCheckUtils]: 106: Hoare triple {10012#false} havoc #t~mem2; {10012#false} is VALID [2020-07-18 00:15:43,180 INFO L280 TraceCheckUtils]: 107: Hoare triple {10012#false} #t~post3 := ~x; {10012#false} is VALID [2020-07-18 00:15:43,180 INFO L280 TraceCheckUtils]: 108: Hoare triple {10012#false} ~x := 1 + #t~post3; {10012#false} is VALID [2020-07-18 00:15:43,180 INFO L280 TraceCheckUtils]: 109: Hoare triple {10012#false} havoc #t~post3; {10012#false} is VALID [2020-07-18 00:15:43,180 INFO L263 TraceCheckUtils]: 110: Hoare triple {10012#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10012#false} is VALID [2020-07-18 00:15:43,181 INFO L280 TraceCheckUtils]: 111: Hoare triple {10012#false} ~x := #in~x; {10012#false} is VALID [2020-07-18 00:15:43,181 INFO L280 TraceCheckUtils]: 112: Hoare triple {10012#false} ~y := #in~y; {10012#false} is VALID [2020-07-18 00:15:43,181 INFO L280 TraceCheckUtils]: 113: Hoare triple {10012#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10012#false} is VALID [2020-07-18 00:15:43,181 INFO L280 TraceCheckUtils]: 114: Hoare triple {10012#false} ~i := #in~i; {10012#false} is VALID [2020-07-18 00:15:43,181 INFO L280 TraceCheckUtils]: 115: Hoare triple {10012#false} ~n := #in~n; {10012#false} is VALID [2020-07-18 00:15:43,182 INFO L280 TraceCheckUtils]: 116: Hoare triple {10012#false} assume !(~x >= ~y); {10012#false} is VALID [2020-07-18 00:15:43,182 INFO L263 TraceCheckUtils]: 117: Hoare triple {10012#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10012#false} is VALID [2020-07-18 00:15:43,182 INFO L280 TraceCheckUtils]: 118: Hoare triple {10012#false} ~cond := #in~cond; {10012#false} is VALID [2020-07-18 00:15:43,182 INFO L280 TraceCheckUtils]: 119: Hoare triple {10012#false} assume 0 == ~cond; {10012#false} is VALID [2020-07-18 00:15:43,182 INFO L280 TraceCheckUtils]: 120: Hoare triple {10012#false} assume !false; {10012#false} is VALID [2020-07-18 00:15:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-18 00:15:44,588 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:15:44,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [392076879] [2020-07-18 00:15:44,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:15:44,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2020-07-18 00:15:44,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7362501] [2020-07-18 00:15:44,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 121 [2020-07-18 00:15:44,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:15:44,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2020-07-18 00:15:44,614 WARN L140 InductivityCheck]: Transition 10071#(and (= check_~y0~0 check_~y) (= (+ check_~x0~0 1) check_~x) (<= (select (select |#memory_int| check_~a.base) (+ (* check_~x0~0 4) check_~a.offset)) (select (select |#memory_int| check_~a.base) (+ (* check_~y 4) check_~a.offset)))) ( _ , call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); , 10072#(and (= |check_#in~x| (+ check_~x0~0 1)) (= |check_#in~y| check_~y0~0) (<= (select (select |#memory_int| |check_#in~a.base|) (+ |check_#in~a.offset| (* check_~x0~0 4))) (select (select |#memory_int| |check_#in~a.base|) (+ |check_#in~a.offset| (* check_~y0~0 4))))) ) not inductive [2020-07-18 00:15:44,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:15:44,615 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:15:44,621 INFO L168 Benchmark]: Toolchain (without parser) took 64369.88 ms. Allocated memory was 139.5 MB in the beginning and 498.1 MB in the end (delta: 358.6 MB). Free memory was 104.2 MB in the beginning and 425.0 MB in the end (delta: -320.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:15:44,622 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:15:44,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.43 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 92.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:15:44,629 INFO L168 Benchmark]: Boogie Preprocessor took 135.96 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.5 MB in the beginning and 180.4 MB in the end (delta: -87.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:15:44,629 INFO L168 Benchmark]: RCFGBuilder took 582.57 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 143.4 MB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:15:44,630 INFO L168 Benchmark]: TraceAbstraction took 63343.65 ms. Allocated memory was 202.9 MB in the beginning and 498.1 MB in the end (delta: 295.2 MB). Free memory was 142.7 MB in the beginning and 425.0 MB in the end (delta: -282.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:15:44,638 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.43 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 92.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.96 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.5 MB in the beginning and 180.4 MB in the end (delta: -87.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 582.57 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 143.4 MB in the end (delta: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63343.65 ms. Allocated memory was 202.9 MB in the beginning and 498.1 MB in the end (delta: 295.2 MB). Free memory was 142.7 MB in the beginning and 425.0 MB in the end (delta: -282.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...