/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -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-8fc6572 [2020-07-11 00:54:20,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:54:20,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:54:20,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:54:20,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:54:20,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:54:20,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:54:20,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:54:20,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:54:20,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:54:20,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:54:20,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:54:20,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:54:20,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:54:20,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:54:20,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:54:20,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:54:20,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:54:20,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:54:20,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:54:20,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:54:20,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:54:20,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:54:20,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:54:20,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:54:20,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:54:20,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:54:20,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:54:20,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:54:20,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:54:20,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:54:20,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:54:20,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:54:20,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:54:20,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:54:20,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:54:20,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:54:20,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:54:20,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:54:20,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:54:20,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:54:20,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:54:20,721 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:54:20,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:54:20,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:54:20,723 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:54:20,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:54:20,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:54:20,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:54:20,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:54:20,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:54:20,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:54:20,724 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:54:20,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:54:20,725 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:54:20,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:54:20,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:54:20,735 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:54:20,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:54:20,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:54:20,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:54:20,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:54:20,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:54:20,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:54:20,736 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:54:21,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:54:21,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:54:21,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:54:21,070 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:54:21,071 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:54:21,072 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-11 00:54:21,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32358dd95/42262ea4effe4e24b534c11c0b9c12db/FLAG73f836157 [2020-07-11 00:54:21,697 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:54:21,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-11 00:54:21,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32358dd95/42262ea4effe4e24b534c11c0b9c12db/FLAG73f836157 [2020-07-11 00:54:22,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32358dd95/42262ea4effe4e24b534c11c0b9c12db [2020-07-11 00:54:22,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:54:22,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:54:22,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:54:22,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:54:22,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:54:22,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c3de90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22, skipping insertion in model container [2020-07-11 00:54:22,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:54:22,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:54:22,382 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:54:22,412 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:54:22,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:54:22,460 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:54:22,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22 WrapperNode [2020-07-11 00:54:22,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:54:22,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:54:22,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:54:22,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:54:22,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,604 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (1/1) ... [2020-07-11 00:54:22,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:54:22,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:54:22,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:54:22,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:54:22,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (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-11 00:54:22,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:54:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:54:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 00:54:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 00:54:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-11 00:54:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:54:22,677 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-11 00:54:22,677 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 00:54:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 00:54:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:54:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 00:54:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 00:54:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 00:54:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:54:22,678 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-11 00:54:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:54:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:54:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 00:54:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-11 00:54:22,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:54:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:54:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:54:22,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:54:23,226 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:54:23,227 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:54:23,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:54:23 BoogieIcfgContainer [2020-07-11 00:54:23,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:54:23,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:54:23,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:54:23,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:54:23,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:54:22" (1/3) ... [2020-07-11 00:54:23,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c642a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:54:23, skipping insertion in model container [2020-07-11 00:54:23,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:22" (2/3) ... [2020-07-11 00:54:23,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c642a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:54:23, skipping insertion in model container [2020-07-11 00:54:23,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:54:23" (3/3) ... [2020-07-11 00:54:23,243 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-11 00:54:23,256 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:54:23,265 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:54:23,282 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:54:23,309 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:54:23,309 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:54:23,309 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:54:23,309 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:54:23,310 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:54:23,310 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:54:23,310 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:54:23,311 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:54:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-11 00:54:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 00:54:23,345 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:23,346 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-11 00:54:23,347 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:23,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-07-11 00:54:23,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:23,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [121950207] [2020-07-11 00:54:23,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:23,837 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-11 00:54:23,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} #valid := #valid[0 := 0]; {90#true} is VALID [2020-07-11 00:54:23,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume 0 < #StackHeapBarrier; {90#true} is VALID [2020-07-11 00:54:23,839 INFO L280 TraceCheckUtils]: 3: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-11 00:54:23,840 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {90#true} {90#true} #117#return; {90#true} is VALID [2020-07-11 00:54:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:23,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-11 00:54:23,850 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-11 00:54:23,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-11 00:54:23,851 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #99#return; {90#true} is VALID [2020-07-11 00:54:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:23,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-11 00:54:23,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-11 00:54:23,864 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-11 00:54:23,865 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #101#return; {90#true} is VALID [2020-07-11 00:54:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:23,889 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-11 00:54:23,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-11 00:54:23,890 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #103#return; {90#true} is VALID [2020-07-11 00:54:23,892 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-11 00:54:23,892 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-11 00:54:23,893 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} #valid := #valid[0 := 0]; {90#true} is VALID [2020-07-11 00:54:23,893 INFO L280 TraceCheckUtils]: 3: Hoare triple {90#true} assume 0 < #StackHeapBarrier; {90#true} is VALID [2020-07-11 00:54:23,893 INFO L280 TraceCheckUtils]: 4: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-11 00:54:23,894 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {90#true} {90#true} #117#return; {90#true} is VALID [2020-07-11 00:54:23,894 INFO L263 TraceCheckUtils]: 6: Hoare triple {90#true} call #t~ret14 := main(); {90#true} is VALID [2020-07-11 00:54:23,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {90#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {90#true} is VALID [2020-07-11 00:54:23,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {90#true} ~n~0 := #t~nondet8; {90#true} is VALID [2020-07-11 00:54:23,896 INFO L280 TraceCheckUtils]: 9: Hoare triple {90#true} havoc #t~nondet8; {90#true} is VALID [2020-07-11 00:54:23,896 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-11 00:54:23,896 INFO L280 TraceCheckUtils]: 11: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-11 00:54:23,897 INFO L280 TraceCheckUtils]: 12: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-11 00:54:23,897 INFO L280 TraceCheckUtils]: 13: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-11 00:54:23,898 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {90#true} {90#true} #99#return; {90#true} is VALID [2020-07-11 00:54:23,898 INFO L280 TraceCheckUtils]: 15: Hoare triple {90#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {90#true} is VALID [2020-07-11 00:54:23,898 INFO L280 TraceCheckUtils]: 16: Hoare triple {90#true} ~i~0 := #t~nondet9; {90#true} is VALID [2020-07-11 00:54:23,899 INFO L280 TraceCheckUtils]: 17: Hoare triple {90#true} havoc #t~nondet9; {90#true} is VALID [2020-07-11 00:54:23,899 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-11 00:54:23,899 INFO L280 TraceCheckUtils]: 19: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-11 00:54:23,900 INFO L280 TraceCheckUtils]: 20: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-11 00:54:23,900 INFO L280 TraceCheckUtils]: 21: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-11 00:54:23,901 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {90#true} {90#true} #101#return; {90#true} is VALID [2020-07-11 00:54:23,901 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-11 00:54:23,903 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-11 00:54:23,904 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-11 00:54:23,904 INFO L280 TraceCheckUtils]: 26: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-11 00:54:23,905 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {90#true} {90#true} #103#return; {90#true} is VALID [2020-07-11 00:54:23,905 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-11 00:54:23,908 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-11 00:54:23,910 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-11 00:54:23,911 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-11 00:54:23,913 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-11 00:54:23,914 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-11 00:54:23,916 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-11 00:54:23,917 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-11 00:54:23,919 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-11 00:54:23,920 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-11 00:54:23,922 INFO L280 TraceCheckUtils]: 38: Hoare triple {113#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {91#false} is VALID [2020-07-11 00:54:23,922 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#false} assume !false; {91#false} is VALID [2020-07-11 00:54:23,930 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-11 00:54:23,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [121950207] [2020-07-11 00:54:23,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:54:23,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 00:54:23,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561168260] [2020-07-11 00:54:23,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-11 00:54:23,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:23,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:54:24,035 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-11 00:54:24,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:54:24,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:54:24,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:54:24,049 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-07-11 00:54:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:27,200 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-07-11 00:54:27,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 00:54:27,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-11 00:54:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:54:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2020-07-11 00:54:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:54:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2020-07-11 00:54:27,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 257 transitions. [2020-07-11 00:54:27,620 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-11 00:54:27,642 INFO L225 Difference]: With dead ends: 221 [2020-07-11 00:54:27,642 INFO L226 Difference]: Without dead ends: 138 [2020-07-11 00:54:27,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 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-11 00:54:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-11 00:54:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-07-11 00:54:27,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:27,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 122 states. [2020-07-11 00:54:27,986 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 122 states. [2020-07-11 00:54:27,987 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 122 states. [2020-07-11 00:54:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:28,001 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-11 00:54:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-07-11 00:54:28,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:28,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:28,005 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 138 states. [2020-07-11 00:54:28,005 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 138 states. [2020-07-11 00:54:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:28,017 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-11 00:54:28,017 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-07-11 00:54:28,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:28,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:28,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:28,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-11 00:54:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-07-11 00:54:28,033 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-07-11 00:54:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:28,034 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-07-11 00:54:28,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:54:28,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 122 states and 132 transitions. [2020-07-11 00:54:28,246 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-11 00:54:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-07-11 00:54:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 00:54:28,249 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:28,249 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-11 00:54:28,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:54:28,250 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:28,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-07-11 00:54:28,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:28,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1841272422] [2020-07-11 00:54:28,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:28,484 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-11 00:54:28,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} #valid := #valid[0 := 0]; {1097#true} is VALID [2020-07-11 00:54:28,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume 0 < #StackHeapBarrier; {1097#true} is VALID [2020-07-11 00:54:28,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-11 00:54:28,485 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2020-07-11 00:54:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:28,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-11 00:54:28,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-11 00:54:28,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-11 00:54:28,491 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #99#return; {1097#true} is VALID [2020-07-11 00:54:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:28,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-11 00:54:28,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-11 00:54:28,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-11 00:54:28,498 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #101#return; {1097#true} is VALID [2020-07-11 00:54:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:28,556 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-11 00:54:28,557 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-11 00:54:28,559 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-11 00:54:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:28,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~x := #in~x; {1097#true} is VALID [2020-07-11 00:54:28,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} ~y := #in~y; {1097#true} is VALID [2020-07-11 00:54:28,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1097#true} is VALID [2020-07-11 00:54:28,569 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} ~i := #in~i; {1097#true} is VALID [2020-07-11 00:54:28,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#true} ~n := #in~n; {1097#true} is VALID [2020-07-11 00:54:28,569 INFO L280 TraceCheckUtils]: 5: Hoare triple {1097#true} assume ~x >= ~y; {1097#true} is VALID [2020-07-11 00:54:28,570 INFO L280 TraceCheckUtils]: 6: Hoare triple {1097#true} #res := ~x; {1097#true} is VALID [2020-07-11 00:54:28,570 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-11 00:54:28,572 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-11 00:54:28,573 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-11 00:54:28,573 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-11 00:54:28,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} #valid := #valid[0 := 0]; {1097#true} is VALID [2020-07-11 00:54:28,574 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} assume 0 < #StackHeapBarrier; {1097#true} is VALID [2020-07-11 00:54:28,574 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-11 00:54:28,575 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2020-07-11 00:54:28,575 INFO L263 TraceCheckUtils]: 6: Hoare triple {1097#true} call #t~ret14 := main(); {1097#true} is VALID [2020-07-11 00:54:28,575 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1097#true} is VALID [2020-07-11 00:54:28,576 INFO L280 TraceCheckUtils]: 8: Hoare triple {1097#true} ~n~0 := #t~nondet8; {1097#true} is VALID [2020-07-11 00:54:28,576 INFO L280 TraceCheckUtils]: 9: Hoare triple {1097#true} havoc #t~nondet8; {1097#true} is VALID [2020-07-11 00:54:28,576 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-11 00:54:28,576 INFO L280 TraceCheckUtils]: 11: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-11 00:54:28,577 INFO L280 TraceCheckUtils]: 12: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-11 00:54:28,577 INFO L280 TraceCheckUtils]: 13: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-11 00:54:28,577 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1097#true} {1097#true} #99#return; {1097#true} is VALID [2020-07-11 00:54:28,578 INFO L280 TraceCheckUtils]: 15: Hoare triple {1097#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1097#true} is VALID [2020-07-11 00:54:28,578 INFO L280 TraceCheckUtils]: 16: Hoare triple {1097#true} ~i~0 := #t~nondet9; {1097#true} is VALID [2020-07-11 00:54:28,578 INFO L280 TraceCheckUtils]: 17: Hoare triple {1097#true} havoc #t~nondet9; {1097#true} is VALID [2020-07-11 00:54:28,578 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-11 00:54:28,579 INFO L280 TraceCheckUtils]: 19: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-11 00:54:28,579 INFO L280 TraceCheckUtils]: 20: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-11 00:54:28,579 INFO L280 TraceCheckUtils]: 21: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-11 00:54:28,580 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1097#true} {1097#true} #101#return; {1097#true} is VALID [2020-07-11 00:54:28,580 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-11 00:54:28,581 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-11 00:54:28,582 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-11 00:54:28,583 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-11 00:54:28,585 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-11 00:54:28,586 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-11 00:54:28,586 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-11 00:54:28,586 INFO L280 TraceCheckUtils]: 30: Hoare triple {1097#true} ~x := #in~x; {1097#true} is VALID [2020-07-11 00:54:28,587 INFO L280 TraceCheckUtils]: 31: Hoare triple {1097#true} ~y := #in~y; {1097#true} is VALID [2020-07-11 00:54:28,587 INFO L280 TraceCheckUtils]: 32: Hoare triple {1097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1097#true} is VALID [2020-07-11 00:54:28,587 INFO L280 TraceCheckUtils]: 33: Hoare triple {1097#true} ~i := #in~i; {1097#true} is VALID [2020-07-11 00:54:28,588 INFO L280 TraceCheckUtils]: 34: Hoare triple {1097#true} ~n := #in~n; {1097#true} is VALID [2020-07-11 00:54:28,588 INFO L280 TraceCheckUtils]: 35: Hoare triple {1097#true} assume ~x >= ~y; {1097#true} is VALID [2020-07-11 00:54:28,588 INFO L280 TraceCheckUtils]: 36: Hoare triple {1097#true} #res := ~x; {1097#true} is VALID [2020-07-11 00:54:28,589 INFO L280 TraceCheckUtils]: 37: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-11 00:54:28,590 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-11 00:54:28,591 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-11 00:54:28,592 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-11 00:54:28,593 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-11 00:54:28,594 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-11 00:54:28,595 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-11 00:54:28,595 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-11 00:54:28,596 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-11 00:54:28,597 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-11 00:54:28,598 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-11 00:54:28,599 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-11 00:54:28,600 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-11 00:54:28,600 INFO L280 TraceCheckUtils]: 50: Hoare triple {1131#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1098#false} is VALID [2020-07-11 00:54:28,601 INFO L280 TraceCheckUtils]: 51: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2020-07-11 00:54:28,606 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-11 00:54:28,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1841272422] [2020-07-11 00:54:28,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:54:28,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-11 00:54:28,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453803630] [2020-07-11 00:54:28,609 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-11 00:54:28,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:28,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 00:54:28,667 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-11 00:54:28,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 00:54:28,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:28,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 00:54:28,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-11 00:54:28,669 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-07-11 00:54:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:31,421 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-11 00:54:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-11 00:54:31,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-11 00:54:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 00:54:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2020-07-11 00:54:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 00:54:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2020-07-11 00:54:31,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 91 transitions. [2020-07-11 00:54:31,555 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-11 00:54:31,560 INFO L225 Difference]: With dead ends: 128 [2020-07-11 00:54:31,560 INFO L226 Difference]: Without dead ends: 108 [2020-07-11 00:54:31,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 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-11 00:54:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-11 00:54:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-07-11 00:54:31,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:31,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 108 states. [2020-07-11 00:54:31,857 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2020-07-11 00:54:31,857 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2020-07-11 00:54:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:31,870 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-11 00:54:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-11 00:54:31,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:31,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:31,879 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2020-07-11 00:54:31,879 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2020-07-11 00:54:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:31,887 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-11 00:54:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-11 00:54:31,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:31,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:31,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:31,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-11 00:54:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-07-11 00:54:31,902 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-07-11 00:54:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:31,905 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-07-11 00:54:31,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 00:54:31,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 116 transitions. [2020-07-11 00:54:32,083 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-11 00:54:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-11 00:54:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-11 00:54:32,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:32,086 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-11 00:54:32,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:54:32,086 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-07-11 00:54:32,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:32,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626100975] [2020-07-11 00:54:32,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,429 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-11 00:54:32,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} #valid := #valid[0 := 0]; {1850#true} is VALID [2020-07-11 00:54:32,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume 0 < #StackHeapBarrier; {1850#true} is VALID [2020-07-11 00:54:32,430 INFO L280 TraceCheckUtils]: 3: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,430 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1850#true} {1850#true} #117#return; {1850#true} is VALID [2020-07-11 00:54:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-11 00:54:32,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-11 00:54:32,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #99#return; {1850#true} is VALID [2020-07-11 00:54:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,439 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-11 00:54:32,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-11 00:54:32,439 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,440 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #101#return; {1850#true} is VALID [2020-07-11 00:54:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,465 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-11 00:54:32,466 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,466 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1850#true} {1850#true} #103#return; {1850#true} is VALID [2020-07-11 00:54:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,476 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-11 00:54:32,477 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-11 00:54:32,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,478 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-11 00:54:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-11 00:54:32,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-11 00:54:32,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,495 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-11 00:54:32,496 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-11 00:54:32,496 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-11 00:54:32,496 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} #valid := #valid[0 := 0]; {1850#true} is VALID [2020-07-11 00:54:32,497 INFO L280 TraceCheckUtils]: 3: Hoare triple {1850#true} assume 0 < #StackHeapBarrier; {1850#true} is VALID [2020-07-11 00:54:32,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,497 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1850#true} {1850#true} #117#return; {1850#true} is VALID [2020-07-11 00:54:32,497 INFO L263 TraceCheckUtils]: 6: Hoare triple {1850#true} call #t~ret14 := main(); {1850#true} is VALID [2020-07-11 00:54:32,498 INFO L280 TraceCheckUtils]: 7: Hoare triple {1850#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1850#true} is VALID [2020-07-11 00:54:32,498 INFO L280 TraceCheckUtils]: 8: Hoare triple {1850#true} ~n~0 := #t~nondet8; {1850#true} is VALID [2020-07-11 00:54:32,498 INFO L280 TraceCheckUtils]: 9: Hoare triple {1850#true} havoc #t~nondet8; {1850#true} is VALID [2020-07-11 00:54:32,498 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-11 00:54:32,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-11 00:54:32,499 INFO L280 TraceCheckUtils]: 12: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-11 00:54:32,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,499 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1850#true} {1850#true} #99#return; {1850#true} is VALID [2020-07-11 00:54:32,499 INFO L280 TraceCheckUtils]: 15: Hoare triple {1850#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1850#true} is VALID [2020-07-11 00:54:32,500 INFO L280 TraceCheckUtils]: 16: Hoare triple {1850#true} ~i~0 := #t~nondet9; {1850#true} is VALID [2020-07-11 00:54:32,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {1850#true} havoc #t~nondet9; {1850#true} is VALID [2020-07-11 00:54:32,500 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-11 00:54:32,501 INFO L280 TraceCheckUtils]: 19: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-11 00:54:32,501 INFO L280 TraceCheckUtils]: 20: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-11 00:54:32,501 INFO L280 TraceCheckUtils]: 21: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,502 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1850#true} {1850#true} #101#return; {1850#true} is VALID [2020-07-11 00:54:32,502 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-11 00:54:32,503 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-11 00:54:32,503 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-11 00:54:32,504 INFO L280 TraceCheckUtils]: 26: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,504 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1850#true} {1850#true} #103#return; {1850#true} is VALID [2020-07-11 00:54:32,504 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-11 00:54:32,505 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-11 00:54:32,505 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-11 00:54:32,506 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-11 00:54:32,507 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-11 00:54:32,507 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-11 00:54:32,511 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-11 00:54:32,512 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-11 00:54:32,513 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-11 00:54:32,513 INFO L280 TraceCheckUtils]: 37: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-11 00:54:32,513 INFO L280 TraceCheckUtils]: 38: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-11 00:54:32,513 INFO L280 TraceCheckUtils]: 39: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,514 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-11 00:54:32,514 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-11 00:54:32,515 INFO L280 TraceCheckUtils]: 42: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-11 00:54:32,515 INFO L280 TraceCheckUtils]: 43: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-11 00:54:32,515 INFO L280 TraceCheckUtils]: 44: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-11 00:54:32,516 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-11 00:54:32,517 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-11 00:54:32,518 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-11 00:54:32,518 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-11 00:54:32,520 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-11 00:54:32,520 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-11 00:54:32,522 INFO L280 TraceCheckUtils]: 51: 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-11 00:54:32,523 INFO L280 TraceCheckUtils]: 52: 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-11 00:54:32,523 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-11 00:54:32,524 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-11 00:54:32,524 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-11 00:54:32,526 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-11 00:54:32,526 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-11 00:54:32,527 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-11 00:54:32,528 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-11 00:54:32,529 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-11 00:54:32,530 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-11 00:54:32,531 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-11 00:54:32,532 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-11 00:54:32,534 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-11 00:54:32,534 INFO L280 TraceCheckUtils]: 65: Hoare triple {1886#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1851#false} is VALID [2020-07-11 00:54:32,534 INFO L280 TraceCheckUtils]: 66: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2020-07-11 00:54:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-11 00:54:32,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626100975] [2020-07-11 00:54:32,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:54:32,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 00:54:32,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307560072] [2020-07-11 00:54:32,545 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-11 00:54:32,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:32,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 00:54:32,611 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-11 00:54:32,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 00:54:32,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 00:54:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:54:32,613 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-07-11 00:54:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:38,386 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-07-11 00:54:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-11 00:54:38,386 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-11 00:54:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2020-07-11 00:54:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2020-07-11 00:54:38,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 191 transitions. [2020-07-11 00:54:38,744 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-11 00:54:38,749 INFO L225 Difference]: With dead ends: 179 [2020-07-11 00:54:38,750 INFO L226 Difference]: Without dead ends: 177 [2020-07-11 00:54:38,751 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 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-11 00:54:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-11 00:54:39,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-07-11 00:54:39,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:39,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 151 states. [2020-07-11 00:54:39,164 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 151 states. [2020-07-11 00:54:39,164 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 151 states. [2020-07-11 00:54:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:39,173 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-07-11 00:54:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-07-11 00:54:39,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:39,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:39,175 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 177 states. [2020-07-11 00:54:39,175 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 177 states. [2020-07-11 00:54:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:39,183 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-07-11 00:54:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-07-11 00:54:39,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:39,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:39,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:39,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-11 00:54:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-07-11 00:54:39,193 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-07-11 00:54:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:39,194 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-07-11 00:54:39,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 00:54:39,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 151 states and 164 transitions. [2020-07-11 00:54:39,473 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-11 00:54:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-07-11 00:54:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-11 00:54:39,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:39,476 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-11 00:54:39,476 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:54:39,476 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-07-11 00:54:39,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:39,477 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1432323390] [2020-07-11 00:54:39,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,784 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-11 00:54:39,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-11 00:54:39,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-11 00:54:39,785 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,785 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2937#true} {2937#true} #117#return; {2937#true} is VALID [2020-07-11 00:54:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-11 00:54:39,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-11 00:54:39,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,792 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-11 00:54:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-11 00:54:39,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-11 00:54:39,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,802 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #101#return; {2937#true} is VALID [2020-07-11 00:54:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,823 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-11 00:54:39,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,824 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-11 00:54:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-11 00:54:39,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-11 00:54:39,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,839 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-11 00:54:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-11 00:54:39,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-11 00:54:39,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,853 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-11 00:54:39,854 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-11 00:54:39,855 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-11 00:54:39,855 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-11 00:54:39,855 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-11 00:54:39,855 INFO L280 TraceCheckUtils]: 4: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,856 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2937#true} {2937#true} #117#return; {2937#true} is VALID [2020-07-11 00:54:39,856 INFO L263 TraceCheckUtils]: 6: Hoare triple {2937#true} call #t~ret14 := main(); {2937#true} is VALID [2020-07-11 00:54:39,856 INFO L280 TraceCheckUtils]: 7: Hoare triple {2937#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2937#true} is VALID [2020-07-11 00:54:39,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {2937#true} ~n~0 := #t~nondet8; {2937#true} is VALID [2020-07-11 00:54:39,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {2937#true} havoc #t~nondet8; {2937#true} is VALID [2020-07-11 00:54:39,857 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-11 00:54:39,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-11 00:54:39,857 INFO L280 TraceCheckUtils]: 12: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-11 00:54:39,857 INFO L280 TraceCheckUtils]: 13: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,858 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-11 00:54:39,858 INFO L280 TraceCheckUtils]: 15: Hoare triple {2937#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2937#true} is VALID [2020-07-11 00:54:39,858 INFO L280 TraceCheckUtils]: 16: Hoare triple {2937#true} ~i~0 := #t~nondet9; {2937#true} is VALID [2020-07-11 00:54:39,858 INFO L280 TraceCheckUtils]: 17: Hoare triple {2937#true} havoc #t~nondet9; {2937#true} is VALID [2020-07-11 00:54:39,859 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-11 00:54:39,859 INFO L280 TraceCheckUtils]: 19: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-11 00:54:39,859 INFO L280 TraceCheckUtils]: 20: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-11 00:54:39,861 INFO L280 TraceCheckUtils]: 21: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,861 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2937#true} {2937#true} #101#return; {2937#true} is VALID [2020-07-11 00:54:39,861 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-11 00:54:39,866 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-11 00:54:39,867 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-11 00:54:39,867 INFO L280 TraceCheckUtils]: 26: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,867 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-11 00:54:39,868 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-11 00:54:39,869 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-11 00:54:39,870 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-11 00:54:39,871 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-11 00:54:39,871 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-11 00:54:39,872 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-11 00:54:39,873 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-11 00:54:39,873 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-11 00:54:39,874 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-11 00:54:39,874 INFO L280 TraceCheckUtils]: 37: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-11 00:54:39,874 INFO L280 TraceCheckUtils]: 38: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-11 00:54:39,874 INFO L280 TraceCheckUtils]: 39: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,875 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-11 00:54:39,875 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-11 00:54:39,876 INFO L280 TraceCheckUtils]: 42: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-11 00:54:39,876 INFO L280 TraceCheckUtils]: 43: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-11 00:54:39,876 INFO L280 TraceCheckUtils]: 44: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-11 00:54:39,878 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-11 00:54:39,878 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-11 00:54:39,879 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-11 00:54:39,880 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-11 00:54:39,881 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-11 00:54:39,881 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-11 00:54:39,882 INFO L280 TraceCheckUtils]: 51: 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-11 00:54:39,883 INFO L280 TraceCheckUtils]: 52: 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-11 00:54:39,883 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-11 00:54:39,884 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-11 00:54:39,885 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-11 00:54:39,886 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-11 00:54:39,887 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-11 00:54:39,889 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-11 00:54:39,890 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-11 00:54:39,890 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-11 00:54:39,891 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-11 00:54:39,892 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-11 00:54:39,893 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-11 00:54:39,893 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-11 00:54:39,894 INFO L280 TraceCheckUtils]: 65: Hoare triple {2973#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2938#false} is VALID [2020-07-11 00:54:39,894 INFO L280 TraceCheckUtils]: 66: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2020-07-11 00:54:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-11 00:54:39,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1432323390] [2020-07-11 00:54:39,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:54:39,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-11 00:54:39,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708383077] [2020-07-11 00:54:39,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-11 00:54:39,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:39,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 00:54:39,977 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-11 00:54:39,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 00:54:39,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:39,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 00:54:39,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:54:39,979 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-07-11 00:54:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:44,939 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-07-11 00:54:44,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-11 00:54:44,939 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-11 00:54:44,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 193 transitions. [2020-07-11 00:54:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 193 transitions. [2020-07-11 00:54:44,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 193 transitions. [2020-07-11 00:54:45,286 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-11 00:54:45,292 INFO L225 Difference]: With dead ends: 221 [2020-07-11 00:54:45,293 INFO L226 Difference]: Without dead ends: 219 [2020-07-11 00:54:45,295 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 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-11 00:54:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-11 00:54:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-07-11 00:54:45,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:45,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 194 states. [2020-07-11 00:54:45,888 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 194 states. [2020-07-11 00:54:45,888 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 194 states. [2020-07-11 00:54:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:45,898 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2020-07-11 00:54:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2020-07-11 00:54:45,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:45,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:45,899 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 219 states. [2020-07-11 00:54:45,899 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 219 states. [2020-07-11 00:54:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:45,909 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2020-07-11 00:54:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2020-07-11 00:54:45,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:45,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:45,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:45,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-11 00:54:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-07-11 00:54:45,918 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-07-11 00:54:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:45,919 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-07-11 00:54:45,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 00:54:45,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 194 states and 212 transitions. [2020-07-11 00:54:46,315 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-11 00:54:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-07-11 00:54:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-11 00:54:46,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:46,317 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-11 00:54:46,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:54:46,318 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:46,319 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-07-11 00:54:46,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:46,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206851696] [2020-07-11 00:54:46,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:46,620 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-11 00:54:46,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} #valid := #valid[0 := 0]; {4283#true} is VALID [2020-07-11 00:54:46,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume 0 < #StackHeapBarrier; {4283#true} is VALID [2020-07-11 00:54:46,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,621 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4283#true} {4283#true} #117#return; {4283#true} is VALID [2020-07-11 00:54:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:46,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-11 00:54:46,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-11 00:54:46,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,626 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4283#true} #99#return; {4283#true} is VALID [2020-07-11 00:54:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:46,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-11 00:54:46,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-11 00:54:46,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,635 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4283#true} #101#return; {4283#true} is VALID [2020-07-11 00:54:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:46,678 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-11 00:54:46,679 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-11 00:54:46,680 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-11 00:54:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:46,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-11 00:54:46,686 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-11 00:54:46,686 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,687 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-11 00:54:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:46,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-11 00:54:46,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-11 00:54:46,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,693 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-11 00:54:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:46,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~x := #in~x; {4283#true} is VALID [2020-07-11 00:54:46,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} ~y := #in~y; {4283#true} is VALID [2020-07-11 00:54:46,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4283#true} is VALID [2020-07-11 00:54:46,700 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} ~i := #in~i; {4283#true} is VALID [2020-07-11 00:54:46,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {4283#true} ~n := #in~n; {4283#true} is VALID [2020-07-11 00:54:46,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {4283#true} assume ~x >= ~y; {4283#true} is VALID [2020-07-11 00:54:46,700 INFO L280 TraceCheckUtils]: 6: Hoare triple {4283#true} #res := ~x; {4283#true} is VALID [2020-07-11 00:54:46,701 INFO L280 TraceCheckUtils]: 7: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,702 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-11 00:54:46,703 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-11 00:54:46,703 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-11 00:54:46,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} #valid := #valid[0 := 0]; {4283#true} is VALID [2020-07-11 00:54:46,704 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} assume 0 < #StackHeapBarrier; {4283#true} is VALID [2020-07-11 00:54:46,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,704 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4283#true} {4283#true} #117#return; {4283#true} is VALID [2020-07-11 00:54:46,704 INFO L263 TraceCheckUtils]: 6: Hoare triple {4283#true} call #t~ret14 := main(); {4283#true} is VALID [2020-07-11 00:54:46,704 INFO L280 TraceCheckUtils]: 7: Hoare triple {4283#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4283#true} is VALID [2020-07-11 00:54:46,705 INFO L280 TraceCheckUtils]: 8: Hoare triple {4283#true} ~n~0 := #t~nondet8; {4283#true} is VALID [2020-07-11 00:54:46,705 INFO L280 TraceCheckUtils]: 9: Hoare triple {4283#true} havoc #t~nondet8; {4283#true} is VALID [2020-07-11 00:54:46,705 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-11 00:54:46,705 INFO L280 TraceCheckUtils]: 11: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-11 00:54:46,706 INFO L280 TraceCheckUtils]: 12: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-11 00:54:46,706 INFO L280 TraceCheckUtils]: 13: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,706 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {4283#true} {4283#true} #99#return; {4283#true} is VALID [2020-07-11 00:54:46,706 INFO L280 TraceCheckUtils]: 15: Hoare triple {4283#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {4283#true} is VALID [2020-07-11 00:54:46,706 INFO L280 TraceCheckUtils]: 16: Hoare triple {4283#true} ~i~0 := #t~nondet9; {4283#true} is VALID [2020-07-11 00:54:46,707 INFO L280 TraceCheckUtils]: 17: Hoare triple {4283#true} havoc #t~nondet9; {4283#true} is VALID [2020-07-11 00:54:46,707 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-11 00:54:46,707 INFO L280 TraceCheckUtils]: 19: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-11 00:54:46,707 INFO L280 TraceCheckUtils]: 20: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-11 00:54:46,707 INFO L280 TraceCheckUtils]: 21: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,708 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4283#true} {4283#true} #101#return; {4283#true} is VALID [2020-07-11 00:54:46,708 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-11 00:54:46,709 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-11 00:54:46,710 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-11 00:54:46,711 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-11 00:54:46,712 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-11 00:54:46,713 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-11 00:54:46,714 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-11 00:54:46,715 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-11 00:54:46,715 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-11 00:54:46,716 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-11 00:54:46,717 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-11 00:54:46,717 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-11 00:54:46,718 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-11 00:54:46,718 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-11 00:54:46,718 INFO L280 TraceCheckUtils]: 37: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-11 00:54:46,719 INFO L280 TraceCheckUtils]: 38: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-11 00:54:46,719 INFO L280 TraceCheckUtils]: 39: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,720 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-11 00:54:46,720 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-11 00:54:46,720 INFO L280 TraceCheckUtils]: 42: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-11 00:54:46,720 INFO L280 TraceCheckUtils]: 43: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-11 00:54:46,721 INFO L280 TraceCheckUtils]: 44: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,722 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-11 00:54:46,722 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-11 00:54:46,723 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-11 00:54:46,723 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-11 00:54:46,724 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-11 00:54:46,725 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-11 00:54:46,725 INFO L280 TraceCheckUtils]: 51: 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-11 00:54:46,726 INFO L280 TraceCheckUtils]: 52: 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-11 00:54:46,726 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-11 00:54:46,727 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-11 00:54:46,727 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-11 00:54:46,728 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-11 00:54:46,728 INFO L280 TraceCheckUtils]: 57: Hoare triple {4283#true} ~x := #in~x; {4283#true} is VALID [2020-07-11 00:54:46,728 INFO L280 TraceCheckUtils]: 58: Hoare triple {4283#true} ~y := #in~y; {4283#true} is VALID [2020-07-11 00:54:46,728 INFO L280 TraceCheckUtils]: 59: Hoare triple {4283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4283#true} is VALID [2020-07-11 00:54:46,728 INFO L280 TraceCheckUtils]: 60: Hoare triple {4283#true} ~i := #in~i; {4283#true} is VALID [2020-07-11 00:54:46,729 INFO L280 TraceCheckUtils]: 61: Hoare triple {4283#true} ~n := #in~n; {4283#true} is VALID [2020-07-11 00:54:46,729 INFO L280 TraceCheckUtils]: 62: Hoare triple {4283#true} assume ~x >= ~y; {4283#true} is VALID [2020-07-11 00:54:46,729 INFO L280 TraceCheckUtils]: 63: Hoare triple {4283#true} #res := ~x; {4283#true} is VALID [2020-07-11 00:54:46,729 INFO L280 TraceCheckUtils]: 64: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-11 00:54:46,731 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-11 00:54:46,731 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-11 00:54:46,732 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-11 00:54:46,732 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-11 00:54:46,733 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-11 00:54:46,734 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-11 00:54:46,735 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-11 00:54:46,735 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-11 00:54:46,736 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-11 00:54:46,737 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-11 00:54:46,737 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-11 00:54:46,738 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-11 00:54:46,739 INFO L280 TraceCheckUtils]: 77: Hoare triple {4327#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4284#false} is VALID [2020-07-11 00:54:46,739 INFO L280 TraceCheckUtils]: 78: Hoare triple {4284#false} assume !false; {4284#false} is VALID [2020-07-11 00:54:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-11 00:54:46,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206851696] [2020-07-11 00:54:46,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:54:46,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 00:54:46,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124221467] [2020-07-11 00:54:46,748 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-11 00:54:46,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:46,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 00:54:46,838 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-11 00:54:46,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 00:54:46,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:46,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 00:54:46,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:54:46,840 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-07-11 00:54:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:51,269 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-11 00:54:51,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 00:54:51,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-11 00:54:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2020-07-11 00:54:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2020-07-11 00:54:51,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2020-07-11 00:54:51,417 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-11 00:54:51,421 INFO L225 Difference]: With dead ends: 206 [2020-07-11 00:54:51,422 INFO L226 Difference]: Without dead ends: 142 [2020-07-11 00:54:51,423 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 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-11 00:54:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-11 00:54:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-07-11 00:54:51,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:51,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 113 states. [2020-07-11 00:54:51,782 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 113 states. [2020-07-11 00:54:51,783 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 113 states. [2020-07-11 00:54:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:51,788 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-11 00:54:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-11 00:54:51,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:51,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:51,789 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 142 states. [2020-07-11 00:54:51,789 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 142 states. [2020-07-11 00:54:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:51,794 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-11 00:54:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-11 00:54:51,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:51,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:51,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:51,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-11 00:54:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-07-11 00:54:51,800 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-07-11 00:54:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:51,800 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-07-11 00:54:51,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 00:54:51,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 120 transitions. [2020-07-11 00:54:52,045 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-11 00:54:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-07-11 00:54:52,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-11 00:54:52,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:52,048 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-11 00:54:52,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:54:52,049 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-07-11 00:54:52,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:52,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1932902696] [2020-07-11 00:54:52,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,544 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-11 00:54:52,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} #valid := #valid[0 := 0]; {5287#true} is VALID [2020-07-11 00:54:52,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume 0 < #StackHeapBarrier; {5287#true} is VALID [2020-07-11 00:54:52,544 INFO L280 TraceCheckUtils]: 3: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,545 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5287#true} {5287#true} #117#return; {5287#true} is VALID [2020-07-11 00:54:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,554 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #99#return; {5287#true} is VALID [2020-07-11 00:54:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,563 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #101#return; {5287#true} is VALID [2020-07-11 00:54:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,594 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-11 00:54:52,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,595 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #103#return; {5287#true} is VALID [2020-07-11 00:54:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,601 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-11 00:54:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,613 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-11 00:54:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,626 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,627 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-11 00:54:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:52,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,638 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-11 00:54:52,639 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-11 00:54:52,639 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-11 00:54:52,639 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} #valid := #valid[0 := 0]; {5287#true} is VALID [2020-07-11 00:54:52,639 INFO L280 TraceCheckUtils]: 3: Hoare triple {5287#true} assume 0 < #StackHeapBarrier; {5287#true} is VALID [2020-07-11 00:54:52,639 INFO L280 TraceCheckUtils]: 4: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,639 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5287#true} {5287#true} #117#return; {5287#true} is VALID [2020-07-11 00:54:52,640 INFO L263 TraceCheckUtils]: 6: Hoare triple {5287#true} call #t~ret14 := main(); {5287#true} is VALID [2020-07-11 00:54:52,640 INFO L280 TraceCheckUtils]: 7: Hoare triple {5287#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5287#true} is VALID [2020-07-11 00:54:52,640 INFO L280 TraceCheckUtils]: 8: Hoare triple {5287#true} ~n~0 := #t~nondet8; {5287#true} is VALID [2020-07-11 00:54:52,640 INFO L280 TraceCheckUtils]: 9: Hoare triple {5287#true} havoc #t~nondet8; {5287#true} is VALID [2020-07-11 00:54:52,641 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-11 00:54:52,641 INFO L280 TraceCheckUtils]: 11: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,641 INFO L280 TraceCheckUtils]: 12: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,642 INFO L280 TraceCheckUtils]: 13: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,642 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {5287#true} {5287#true} #99#return; {5287#true} is VALID [2020-07-11 00:54:52,642 INFO L280 TraceCheckUtils]: 15: Hoare triple {5287#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {5287#true} is VALID [2020-07-11 00:54:52,642 INFO L280 TraceCheckUtils]: 16: Hoare triple {5287#true} ~i~0 := #t~nondet9; {5287#true} is VALID [2020-07-11 00:54:52,643 INFO L280 TraceCheckUtils]: 17: Hoare triple {5287#true} havoc #t~nondet9; {5287#true} is VALID [2020-07-11 00:54:52,643 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-11 00:54:52,643 INFO L280 TraceCheckUtils]: 19: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,643 INFO L280 TraceCheckUtils]: 20: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,643 INFO L280 TraceCheckUtils]: 21: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,643 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {5287#true} {5287#true} #101#return; {5287#true} is VALID [2020-07-11 00:54:52,643 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-11 00:54:52,644 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-11 00:54:52,645 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-11 00:54:52,645 INFO L280 TraceCheckUtils]: 26: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,645 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {5287#true} {5287#true} #103#return; {5287#true} is VALID [2020-07-11 00:54:52,645 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-11 00:54:52,651 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-11 00:54:52,652 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-11 00:54:52,653 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-11 00:54:52,653 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-11 00:54:52,654 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-11 00:54:52,655 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-11 00:54:52,656 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-11 00:54:52,656 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-11 00:54:52,656 INFO L280 TraceCheckUtils]: 37: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,656 INFO L280 TraceCheckUtils]: 38: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,656 INFO L280 TraceCheckUtils]: 39: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,657 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-11 00:54:52,657 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-11 00:54:52,658 INFO L280 TraceCheckUtils]: 42: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,658 INFO L280 TraceCheckUtils]: 43: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,658 INFO L280 TraceCheckUtils]: 44: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,659 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-11 00:54:52,660 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-11 00:54:52,660 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-11 00:54:52,661 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-11 00:54:52,662 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-11 00:54:52,662 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-11 00:54:52,663 INFO L280 TraceCheckUtils]: 51: 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-11 00:54:52,664 INFO L280 TraceCheckUtils]: 52: 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-11 00:54:52,665 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-11 00:54:52,665 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-11 00:54:52,666 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-11 00:54:52,668 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-11 00:54:52,669 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-11 00:54:52,669 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-11 00:54:52,670 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-11 00:54:52,671 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-11 00:54:52,671 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-11 00:54:52,672 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-11 00:54:52,672 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-11 00:54:52,672 INFO L280 TraceCheckUtils]: 64: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,673 INFO L280 TraceCheckUtils]: 65: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,673 INFO L280 TraceCheckUtils]: 66: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,674 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-11 00:54:52,674 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-11 00:54:52,674 INFO L280 TraceCheckUtils]: 69: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-11 00:54:52,674 INFO L280 TraceCheckUtils]: 70: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-11 00:54:52,675 INFO L280 TraceCheckUtils]: 71: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-11 00:54:52,675 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-11 00:54:52,676 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-11 00:54:52,677 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-11 00:54:52,678 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-11 00:54:52,678 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-11 00:54:52,679 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-11 00:54:52,680 INFO L280 TraceCheckUtils]: 78: 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-11 00:54:52,680 INFO L280 TraceCheckUtils]: 79: 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-11 00:54:52,681 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-11 00:54:52,682 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-11 00:54:52,683 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-11 00:54:52,684 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-11 00:54:52,685 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-11 00:54:52,686 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-11 00:54:52,687 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-11 00:54:52,687 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-11 00:54:52,688 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-11 00:54:52,689 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-11 00:54:52,690 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-11 00:54:52,690 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-11 00:54:52,691 INFO L280 TraceCheckUtils]: 92: Hoare triple {5336#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5288#false} is VALID [2020-07-11 00:54:52,691 INFO L280 TraceCheckUtils]: 93: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2020-07-11 00:54:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-11 00:54:52,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1932902696] [2020-07-11 00:54:52,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:54:52,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-11 00:54:52,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390259700] [2020-07-11 00:54:52,720 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-11 00:54:52,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:52,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-11 00:54:52,817 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-11 00:54:52,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-11 00:54:52,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:52,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-11 00:54:52,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-11 00:54:52,819 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-07-11 00:54:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:58,349 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-07-11 00:54:58,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-11 00:54:58,349 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-11 00:54:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:54:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2020-07-11 00:54:58,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:54:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2020-07-11 00:54:58,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 148 transitions. [2020-07-11 00:54:58,600 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-11 00:54:58,607 INFO L225 Difference]: With dead ends: 168 [2020-07-11 00:54:58,608 INFO L226 Difference]: Without dead ends: 166 [2020-07-11 00:54:58,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 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-11 00:54:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-11 00:54:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-07-11 00:54:59,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:59,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 119 states. [2020-07-11 00:54:59,044 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 119 states. [2020-07-11 00:54:59,044 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 119 states. [2020-07-11 00:54:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:59,050 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2020-07-11 00:54:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2020-07-11 00:54:59,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:59,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:59,051 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 166 states. [2020-07-11 00:54:59,051 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 166 states. [2020-07-11 00:54:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:59,057 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2020-07-11 00:54:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2020-07-11 00:54:59,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:59,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:59,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:59,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-11 00:54:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-07-11 00:54:59,064 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-07-11 00:54:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:59,064 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-07-11 00:54:59,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-11 00:54:59,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 128 transitions. [2020-07-11 00:54:59,340 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-11 00:54:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-07-11 00:54:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-11 00:54:59,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:59,342 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-11 00:54:59,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 00:54:59,343 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-07-11 00:54:59,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:59,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061240134] [2020-07-11 00:54:59,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,816 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-11 00:54:59,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} #valid := #valid[0 := 0]; {6294#true} is VALID [2020-07-11 00:54:59,817 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume 0 < #StackHeapBarrier; {6294#true} is VALID [2020-07-11 00:54:59,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,817 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6294#true} {6294#true} #117#return; {6294#true} is VALID [2020-07-11 00:54:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,824 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6294#true} #99#return; {6294#true} is VALID [2020-07-11 00:54:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,838 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6294#true} #101#return; {6294#true} is VALID [2020-07-11 00:54:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,861 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-11 00:54:59,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,862 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6294#true} {6294#true} #103#return; {6294#true} is VALID [2020-07-11 00:54:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,873 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-11 00:54:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,881 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-11 00:54:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,885 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,887 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-11 00:54:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:59,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,892 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,893 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-11 00:54:59,893 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-11 00:54:59,894 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-11 00:54:59,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} #valid := #valid[0 := 0]; {6294#true} is VALID [2020-07-11 00:54:59,894 INFO L280 TraceCheckUtils]: 3: Hoare triple {6294#true} assume 0 < #StackHeapBarrier; {6294#true} is VALID [2020-07-11 00:54:59,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,894 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6294#true} {6294#true} #117#return; {6294#true} is VALID [2020-07-11 00:54:59,895 INFO L263 TraceCheckUtils]: 6: Hoare triple {6294#true} call #t~ret14 := main(); {6294#true} is VALID [2020-07-11 00:54:59,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {6294#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6294#true} is VALID [2020-07-11 00:54:59,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {6294#true} ~n~0 := #t~nondet8; {6294#true} is VALID [2020-07-11 00:54:59,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {6294#true} havoc #t~nondet8; {6294#true} is VALID [2020-07-11 00:54:59,899 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-11 00:54:59,899 INFO L280 TraceCheckUtils]: 11: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,899 INFO L280 TraceCheckUtils]: 12: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,899 INFO L280 TraceCheckUtils]: 13: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,899 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {6294#true} {6294#true} #99#return; {6294#true} is VALID [2020-07-11 00:54:59,900 INFO L280 TraceCheckUtils]: 15: Hoare triple {6294#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {6294#true} is VALID [2020-07-11 00:54:59,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {6294#true} ~i~0 := #t~nondet9; {6294#true} is VALID [2020-07-11 00:54:59,900 INFO L280 TraceCheckUtils]: 17: Hoare triple {6294#true} havoc #t~nondet9; {6294#true} is VALID [2020-07-11 00:54:59,902 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-11 00:54:59,902 INFO L280 TraceCheckUtils]: 19: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,903 INFO L280 TraceCheckUtils]: 20: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,903 INFO L280 TraceCheckUtils]: 21: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,903 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {6294#true} {6294#true} #101#return; {6294#true} is VALID [2020-07-11 00:54:59,903 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-11 00:54:59,905 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-11 00:54:59,905 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-11 00:54:59,905 INFO L280 TraceCheckUtils]: 26: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,905 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {6294#true} {6294#true} #103#return; {6294#true} is VALID [2020-07-11 00:54:59,905 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-11 00:54:59,907 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-11 00:54:59,907 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-11 00:54:59,908 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-11 00:54:59,909 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-11 00:54:59,909 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-11 00:54:59,910 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-11 00:54:59,910 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-11 00:54:59,911 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-11 00:54:59,911 INFO L280 TraceCheckUtils]: 37: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,911 INFO L280 TraceCheckUtils]: 38: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,911 INFO L280 TraceCheckUtils]: 39: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,912 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-11 00:54:59,912 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-11 00:54:59,912 INFO L280 TraceCheckUtils]: 42: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,913 INFO L280 TraceCheckUtils]: 43: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,913 INFO L280 TraceCheckUtils]: 44: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,913 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-11 00:54:59,914 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-11 00:54:59,915 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-11 00:54:59,915 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-11 00:54:59,916 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-11 00:54:59,917 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-11 00:54:59,917 INFO L280 TraceCheckUtils]: 51: 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-11 00:54:59,918 INFO L280 TraceCheckUtils]: 52: 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-11 00:54:59,919 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-11 00:54:59,920 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-11 00:54:59,921 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-11 00:54:59,923 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-11 00:54:59,926 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-11 00:54:59,929 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-11 00:54:59,930 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-11 00:54:59,930 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-11 00:54:59,931 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-11 00:54:59,932 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-11 00:54:59,932 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-11 00:54:59,932 INFO L280 TraceCheckUtils]: 64: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,932 INFO L280 TraceCheckUtils]: 65: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,932 INFO L280 TraceCheckUtils]: 66: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,933 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-11 00:54:59,934 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-11 00:54:59,934 INFO L280 TraceCheckUtils]: 69: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-11 00:54:59,934 INFO L280 TraceCheckUtils]: 70: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-11 00:54:59,934 INFO L280 TraceCheckUtils]: 71: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-11 00:54:59,935 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-11 00:54:59,936 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-11 00:54:59,936 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-11 00:54:59,937 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-11 00:54:59,938 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-11 00:54:59,938 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-11 00:54:59,939 INFO L280 TraceCheckUtils]: 78: 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-11 00:54:59,940 INFO L280 TraceCheckUtils]: 79: 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-11 00:54:59,940 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-11 00:54:59,941 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-11 00:54:59,942 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-11 00:54:59,944 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-11 00:54:59,944 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-11 00:54:59,945 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-11 00:54:59,946 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-11 00:54:59,947 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-11 00:54:59,948 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-11 00:54:59,949 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-11 00:54:59,950 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-11 00:54:59,951 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-11 00:54:59,952 INFO L280 TraceCheckUtils]: 92: Hoare triple {6343#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6295#false} is VALID [2020-07-11 00:54:59,952 INFO L280 TraceCheckUtils]: 93: Hoare triple {6295#false} assume !false; {6295#false} is VALID [2020-07-11 00:54:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-11 00:54:59,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061240134] [2020-07-11 00:54:59,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:54:59,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-11 00:54:59,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942780404] [2020-07-11 00:54:59,970 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-11 00:54:59,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:59,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-11 00:55:00,080 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-11 00:55:00,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-11 00:55:00,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:55:00,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-11 00:55:00,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-11 00:55:00,082 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-07-11 00:55:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:06,811 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-07-11 00:55:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-11 00:55:06,811 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-11 00:55:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:55:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:55:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-11 00:55:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:55:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-11 00:55:06,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 148 transitions. [2020-07-11 00:55:07,082 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-11 00:55:07,088 INFO L225 Difference]: With dead ends: 191 [2020-07-11 00:55:07,088 INFO L226 Difference]: Without dead ends: 189 [2020-07-11 00:55:07,089 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2020-07-11 00:55:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-11 00:55:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-07-11 00:55:07,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:55:07,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 142 states. [2020-07-11 00:55:07,601 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 142 states. [2020-07-11 00:55:07,601 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 142 states. [2020-07-11 00:55:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:07,615 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2020-07-11 00:55:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2020-07-11 00:55:07,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:07,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:55:07,617 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 189 states. [2020-07-11 00:55:07,617 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 189 states. [2020-07-11 00:55:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:07,631 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2020-07-11 00:55:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2020-07-11 00:55:07,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:07,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:55:07,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:55:07,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:55:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-11 00:55:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-07-11 00:55:07,647 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-07-11 00:55:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:55:07,647 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-07-11 00:55:07,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-11 00:55:07,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 153 transitions. [2020-07-11 00:55:08,043 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-11 00:55:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-11 00:55:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-11 00:55:08,045 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:55:08,046 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-11 00:55:08,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 00:55:08,046 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:55:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:55:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-07-11 00:55:08,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:55:08,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1078583872] [2020-07-11 00:55:08,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:55:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,493 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-11 00:55:08,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} #valid := #valid[0 := 0]; {7443#true} is VALID [2020-07-11 00:55:08,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume 0 < #StackHeapBarrier; {7443#true} is VALID [2020-07-11 00:55:08,494 INFO L280 TraceCheckUtils]: 3: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,494 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7443#true} {7443#true} #117#return; {7443#true} is VALID [2020-07-11 00:55:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,502 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #99#return; {7443#true} is VALID [2020-07-11 00:55:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,531 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #101#return; {7443#true} is VALID [2020-07-11 00:55:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,572 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-11 00:55:08,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,573 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7443#true} {7443#true} #103#return; {7443#true} is VALID [2020-07-11 00:55:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,582 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,585 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-11 00:55:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,591 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,593 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-11 00:55:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,605 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,606 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-11 00:55:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:08,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,613 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-11 00:55:08,616 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-11 00:55:08,617 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-11 00:55:08,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} #valid := #valid[0 := 0]; {7443#true} is VALID [2020-07-11 00:55:08,617 INFO L280 TraceCheckUtils]: 3: Hoare triple {7443#true} assume 0 < #StackHeapBarrier; {7443#true} is VALID [2020-07-11 00:55:08,617 INFO L280 TraceCheckUtils]: 4: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,618 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7443#true} {7443#true} #117#return; {7443#true} is VALID [2020-07-11 00:55:08,618 INFO L263 TraceCheckUtils]: 6: Hoare triple {7443#true} call #t~ret14 := main(); {7443#true} is VALID [2020-07-11 00:55:08,618 INFO L280 TraceCheckUtils]: 7: Hoare triple {7443#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {7443#true} is VALID [2020-07-11 00:55:08,618 INFO L280 TraceCheckUtils]: 8: Hoare triple {7443#true} ~n~0 := #t~nondet8; {7443#true} is VALID [2020-07-11 00:55:08,619 INFO L280 TraceCheckUtils]: 9: Hoare triple {7443#true} havoc #t~nondet8; {7443#true} is VALID [2020-07-11 00:55:08,619 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-11 00:55:08,619 INFO L280 TraceCheckUtils]: 11: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,619 INFO L280 TraceCheckUtils]: 12: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,619 INFO L280 TraceCheckUtils]: 13: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,620 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7443#true} {7443#true} #99#return; {7443#true} is VALID [2020-07-11 00:55:08,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {7443#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {7443#true} is VALID [2020-07-11 00:55:08,620 INFO L280 TraceCheckUtils]: 16: Hoare triple {7443#true} ~i~0 := #t~nondet9; {7443#true} is VALID [2020-07-11 00:55:08,620 INFO L280 TraceCheckUtils]: 17: Hoare triple {7443#true} havoc #t~nondet9; {7443#true} is VALID [2020-07-11 00:55:08,620 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-11 00:55:08,621 INFO L280 TraceCheckUtils]: 19: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,621 INFO L280 TraceCheckUtils]: 20: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,621 INFO L280 TraceCheckUtils]: 21: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,621 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {7443#true} {7443#true} #101#return; {7443#true} is VALID [2020-07-11 00:55:08,622 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-11 00:55:08,623 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-11 00:55:08,623 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-11 00:55:08,623 INFO L280 TraceCheckUtils]: 26: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,624 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7443#true} {7443#true} #103#return; {7443#true} is VALID [2020-07-11 00:55:08,624 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-11 00:55:08,625 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-11 00:55:08,627 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-11 00:55:08,627 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-11 00:55:08,628 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-11 00:55:08,629 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-11 00:55:08,631 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-11 00:55:08,632 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-11 00:55:08,632 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-11 00:55:08,632 INFO L280 TraceCheckUtils]: 37: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,632 INFO L280 TraceCheckUtils]: 38: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,633 INFO L280 TraceCheckUtils]: 39: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,634 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-11 00:55:08,634 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-11 00:55:08,634 INFO L280 TraceCheckUtils]: 42: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,634 INFO L280 TraceCheckUtils]: 43: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,635 INFO L280 TraceCheckUtils]: 44: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,636 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-11 00:55:08,636 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-11 00:55:08,637 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-11 00:55:08,638 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-11 00:55:08,639 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-11 00:55:08,639 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-11 00:55:08,642 INFO L280 TraceCheckUtils]: 51: 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-11 00:55:08,643 INFO L280 TraceCheckUtils]: 52: 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-11 00:55:08,644 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-11 00:55:08,645 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-11 00:55:08,646 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-11 00:55:08,647 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-11 00:55:08,648 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-11 00:55:08,648 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-11 00:55:08,649 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-11 00:55:08,650 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-11 00:55:08,650 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-11 00:55:08,651 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-11 00:55:08,651 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-11 00:55:08,651 INFO L280 TraceCheckUtils]: 64: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,652 INFO L280 TraceCheckUtils]: 65: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,652 INFO L280 TraceCheckUtils]: 66: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,652 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-11 00:55:08,653 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-11 00:55:08,653 INFO L280 TraceCheckUtils]: 69: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-11 00:55:08,653 INFO L280 TraceCheckUtils]: 70: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-11 00:55:08,653 INFO L280 TraceCheckUtils]: 71: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-11 00:55:08,655 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-11 00:55:08,655 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-11 00:55:08,656 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-11 00:55:08,657 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-11 00:55:08,657 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-11 00:55:08,658 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-11 00:55:08,659 INFO L280 TraceCheckUtils]: 78: 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-11 00:55:08,659 INFO L280 TraceCheckUtils]: 79: 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-11 00:55:08,662 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-11 00:55:08,663 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-11 00:55:08,664 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-11 00:55:08,665 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-11 00:55:08,666 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-11 00:55:08,666 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-11 00:55:08,667 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-11 00:55:08,668 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-11 00:55:08,668 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-11 00:55:08,669 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-11 00:55:08,670 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-11 00:55:08,671 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-11 00:55:08,671 INFO L280 TraceCheckUtils]: 92: Hoare triple {7492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7444#false} is VALID [2020-07-11 00:55:08,671 INFO L280 TraceCheckUtils]: 93: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2020-07-11 00:55:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-11 00:55:08,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1078583872] [2020-07-11 00:55:08,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:55:08,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-11 00:55:08,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772590316] [2020-07-11 00:55:08,690 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-11 00:55:08,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:55:08,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-11 00:55:08,801 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-11 00:55:08,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-11 00:55:08,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:55:08,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-11 00:55:08,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-11 00:55:08,803 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-07-11 00:55:15,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:15,070 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-07-11 00:55:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-11 00:55:15,071 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-11 00:55:15,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:55:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:55:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-11 00:55:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:55:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-11 00:55:15,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 148 transitions. [2020-07-11 00:55:15,348 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-11 00:55:15,354 INFO L225 Difference]: With dead ends: 208 [2020-07-11 00:55:15,354 INFO L226 Difference]: Without dead ends: 206 [2020-07-11 00:55:15,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-07-11 00:55:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-11 00:55:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-07-11 00:55:16,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:55:16,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 182 states. [2020-07-11 00:55:16,049 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 182 states. [2020-07-11 00:55:16,049 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 182 states. [2020-07-11 00:55:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:16,058 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2020-07-11 00:55:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2020-07-11 00:55:16,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:16,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:55:16,060 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 206 states. [2020-07-11 00:55:16,060 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 206 states. [2020-07-11 00:55:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:16,068 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2020-07-11 00:55:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2020-07-11 00:55:16,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:16,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:55:16,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:55:16,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:55:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-11 00:55:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-07-11 00:55:16,076 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-07-11 00:55:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:55:16,077 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-07-11 00:55:16,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-11 00:55:16,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 182 states and 195 transitions. [2020-07-11 00:55:16,596 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-11 00:55:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-07-11 00:55:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-11 00:55:16,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:55:16,598 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-11 00:55:16,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 00:55:16,599 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:55:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:55:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-07-11 00:55:16,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:55:16,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106791941] [2020-07-11 00:55:16,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:55:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,497 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-11 00:55:17,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} #valid := #valid[0 := 0]; {8741#true} is VALID [2020-07-11 00:55:17,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume 0 < #StackHeapBarrier; {8741#true} is VALID [2020-07-11 00:55:17,498 INFO L280 TraceCheckUtils]: 3: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,498 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8741#true} {8741#true} #117#return; {8741#true} is VALID [2020-07-11 00:55:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,502 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,503 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,504 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8741#true} #99#return; {8741#true} is VALID [2020-07-11 00:55:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,509 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8741#true} #101#return; {8741#true} is VALID [2020-07-11 00:55:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,553 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-11 00:55:17,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,554 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8741#true} {8741#true} #103#return; {8741#true} is VALID [2020-07-11 00:55:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,562 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-11 00:55:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,574 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,575 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-11 00:55:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,580 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,581 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,582 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-11 00:55:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,589 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-11 00:55:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,595 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,596 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,597 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-11 00:55:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:17,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,604 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,605 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-11 00:55:17,606 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-11 00:55:17,607 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-11 00:55:17,607 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} #valid := #valid[0 := 0]; {8741#true} is VALID [2020-07-11 00:55:17,607 INFO L280 TraceCheckUtils]: 3: Hoare triple {8741#true} assume 0 < #StackHeapBarrier; {8741#true} is VALID [2020-07-11 00:55:17,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,608 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8741#true} {8741#true} #117#return; {8741#true} is VALID [2020-07-11 00:55:17,608 INFO L263 TraceCheckUtils]: 6: Hoare triple {8741#true} call #t~ret14 := main(); {8741#true} is VALID [2020-07-11 00:55:17,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {8741#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8741#true} is VALID [2020-07-11 00:55:17,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {8741#true} ~n~0 := #t~nondet8; {8741#true} is VALID [2020-07-11 00:55:17,609 INFO L280 TraceCheckUtils]: 9: Hoare triple {8741#true} havoc #t~nondet8; {8741#true} is VALID [2020-07-11 00:55:17,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-11 00:55:17,610 INFO L280 TraceCheckUtils]: 11: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,610 INFO L280 TraceCheckUtils]: 13: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,611 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {8741#true} {8741#true} #99#return; {8741#true} is VALID [2020-07-11 00:55:17,611 INFO L280 TraceCheckUtils]: 15: Hoare triple {8741#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {8741#true} is VALID [2020-07-11 00:55:17,611 INFO L280 TraceCheckUtils]: 16: Hoare triple {8741#true} ~i~0 := #t~nondet9; {8741#true} is VALID [2020-07-11 00:55:17,612 INFO L280 TraceCheckUtils]: 17: Hoare triple {8741#true} havoc #t~nondet9; {8741#true} is VALID [2020-07-11 00:55:17,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-11 00:55:17,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,613 INFO L280 TraceCheckUtils]: 20: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,613 INFO L280 TraceCheckUtils]: 21: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,613 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {8741#true} {8741#true} #101#return; {8741#true} is VALID [2020-07-11 00:55:17,614 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-11 00:55:17,616 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-11 00:55:17,616 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-11 00:55:17,617 INFO L280 TraceCheckUtils]: 26: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,617 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8741#true} {8741#true} #103#return; {8741#true} is VALID [2020-07-11 00:55:17,617 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-11 00:55:17,619 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-11 00:55:17,621 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-11 00:55:17,622 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-11 00:55:17,623 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-11 00:55:17,624 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-11 00:55:17,625 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-11 00:55:17,627 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-11 00:55:17,627 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-11 00:55:17,627 INFO L280 TraceCheckUtils]: 37: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,628 INFO L280 TraceCheckUtils]: 38: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,628 INFO L280 TraceCheckUtils]: 39: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,629 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-11 00:55:17,629 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-11 00:55:17,630 INFO L280 TraceCheckUtils]: 42: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,630 INFO L280 TraceCheckUtils]: 43: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,630 INFO L280 TraceCheckUtils]: 44: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,632 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-11 00:55:17,633 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-11 00:55:17,634 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-11 00:55:17,635 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-11 00:55:17,637 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-11 00:55:17,638 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-11 00:55:17,639 INFO L280 TraceCheckUtils]: 51: 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-11 00:55:17,640 INFO L280 TraceCheckUtils]: 52: 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-11 00:55:17,641 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-11 00:55:17,642 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-11 00:55:17,643 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-11 00:55:17,646 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-11 00:55:17,647 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-11 00:55:17,648 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-11 00:55:17,650 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-11 00:55:17,651 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-11 00:55:17,652 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-11 00:55:17,653 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-11 00:55:17,654 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-11 00:55:17,654 INFO L280 TraceCheckUtils]: 64: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,654 INFO L280 TraceCheckUtils]: 65: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,654 INFO L280 TraceCheckUtils]: 66: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,656 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-11 00:55:17,656 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-11 00:55:17,656 INFO L280 TraceCheckUtils]: 69: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,657 INFO L280 TraceCheckUtils]: 70: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,657 INFO L280 TraceCheckUtils]: 71: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,658 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-11 00:55:17,659 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-11 00:55:17,661 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-11 00:55:17,662 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-11 00:55:17,663 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-11 00:55:17,664 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-11 00:55:17,665 INFO L280 TraceCheckUtils]: 78: 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-11 00:55:17,666 INFO L280 TraceCheckUtils]: 79: 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-11 00:55:17,667 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-11 00:55:17,669 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-11 00:55:17,670 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-11 00:55:17,671 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-11 00:55:17,672 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-11 00:55:17,673 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-11 00:55:17,674 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-11 00:55:17,675 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-11 00:55:17,675 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-11 00:55:17,676 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-11 00:55:17,676 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-11 00:55:17,677 INFO L280 TraceCheckUtils]: 91: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,677 INFO L280 TraceCheckUtils]: 92: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,677 INFO L280 TraceCheckUtils]: 93: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,678 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-11 00:55:17,678 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-11 00:55:17,678 INFO L280 TraceCheckUtils]: 96: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-11 00:55:17,679 INFO L280 TraceCheckUtils]: 97: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-11 00:55:17,679 INFO L280 TraceCheckUtils]: 98: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-11 00:55:17,680 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-11 00:55:17,681 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-11 00:55:17,682 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-11 00:55:17,684 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-11 00:55:17,685 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-11 00:55:17,686 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-11 00:55:17,687 INFO L280 TraceCheckUtils]: 105: 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-11 00:55:17,688 INFO L280 TraceCheckUtils]: 106: 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-11 00:55:17,689 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-11 00:55:17,691 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-11 00:55:17,692 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-11 00:55:17,695 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-11 00:55:17,696 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-11 00:55:17,697 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-11 00:55:17,698 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-11 00:55:17,699 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-11 00:55:17,701 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-11 00:55:17,702 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-11 00:55:17,704 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-11 00:55:17,705 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-11 00:55:17,706 INFO L280 TraceCheckUtils]: 119: Hoare triple {8803#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8742#false} is VALID [2020-07-11 00:55:17,706 INFO L280 TraceCheckUtils]: 120: Hoare triple {8742#false} assume !false; {8742#false} is VALID [2020-07-11 00:55:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-07-11 00:55:17,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106791941] [2020-07-11 00:55:17,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:55:17,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-07-11 00:55:17,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951257311] [2020-07-11 00:55:17,757 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-11 00:55:17,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:55:17,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2020-07-11 00:55:17,953 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-11 00:55:17,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-11 00:55:17,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:55:17,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-11 00:55:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-11 00:55:17,955 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-07-11 00:55:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:27,247 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-07-11 00:55:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-11 00:55:27,247 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-11 00:55:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:55:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-11 00:55:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 176 transitions. [2020-07-11 00:55:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-11 00:55:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 176 transitions. [2020-07-11 00:55:27,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 176 transitions. [2020-07-11 00:55:27,589 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-11 00:55:27,594 INFO L225 Difference]: With dead ends: 237 [2020-07-11 00:55:27,595 INFO L226 Difference]: Without dead ends: 171 [2020-07-11 00:55:27,598 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-07-11 00:55:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-11 00:55:28,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-07-11 00:55:28,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:55:28,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 159 states. [2020-07-11 00:55:28,252 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 159 states. [2020-07-11 00:55:28,252 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 159 states. [2020-07-11 00:55:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:28,258 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2020-07-11 00:55:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2020-07-11 00:55:28,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:28,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:55:28,259 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 171 states. [2020-07-11 00:55:28,259 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 171 states. [2020-07-11 00:55:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:28,265 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2020-07-11 00:55:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2020-07-11 00:55:28,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:28,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:55:28,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:55:28,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:55:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-11 00:55:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-11 00:55:28,271 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-07-11 00:55:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:55:28,271 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-11 00:55:28,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-11 00:55:28,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 169 transitions. [2020-07-11 00:55:28,737 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-11 00:55:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-11 00:55:28,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-11 00:55:28,740 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:55:28,740 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-11 00:55:28,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 00:55:28,740 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:55:28,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:55:28,741 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-07-11 00:55:28,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:55:28,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [533856669] [2020-07-11 00:55:28,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:55:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:28,912 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-11 00:55:28,912 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} #valid := #valid[0 := 0]; {10011#true} is VALID [2020-07-11 00:55:28,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume 0 < #StackHeapBarrier; {10011#true} is VALID [2020-07-11 00:55:28,913 INFO L280 TraceCheckUtils]: 3: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:28,913 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10011#true} {10011#true} #117#return; {10011#true} is VALID [2020-07-11 00:55:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:28,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:28,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:28,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:28,920 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10011#true} #99#return; {10011#true} is VALID [2020-07-11 00:55:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:28,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:28,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:28,925 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:28,925 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10011#true} #101#return; {10011#true} is VALID [2020-07-11 00:55:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:28,969 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-11 00:55:28,970 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-11 00:55:28,972 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-11 00:55:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:28,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:28,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:28,978 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:28,980 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-11 00:55:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:28,985 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:28,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:28,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:28,988 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-11 00:55:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:28,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:28,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:28,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:28,999 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-11 00:55:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:29,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,005 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,007 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-11 00:55:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:29,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,012 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,012 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10012#false} #109#return; {10012#false} is VALID [2020-07-11 00:55:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:55:29,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,024 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10012#false} #111#return; {10012#false} is VALID [2020-07-11 00:55:29,026 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-11 00:55:29,026 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-11 00:55:29,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} #valid := #valid[0 := 0]; {10011#true} is VALID [2020-07-11 00:55:29,027 INFO L280 TraceCheckUtils]: 3: Hoare triple {10011#true} assume 0 < #StackHeapBarrier; {10011#true} is VALID [2020-07-11 00:55:29,027 INFO L280 TraceCheckUtils]: 4: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,027 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10011#true} {10011#true} #117#return; {10011#true} is VALID [2020-07-11 00:55:29,028 INFO L263 TraceCheckUtils]: 6: Hoare triple {10011#true} call #t~ret14 := main(); {10011#true} is VALID [2020-07-11 00:55:29,028 INFO L280 TraceCheckUtils]: 7: Hoare triple {10011#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10011#true} is VALID [2020-07-11 00:55:29,028 INFO L280 TraceCheckUtils]: 8: Hoare triple {10011#true} ~n~0 := #t~nondet8; {10011#true} is VALID [2020-07-11 00:55:29,029 INFO L280 TraceCheckUtils]: 9: Hoare triple {10011#true} havoc #t~nondet8; {10011#true} is VALID [2020-07-11 00:55:29,029 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-11 00:55:29,029 INFO L280 TraceCheckUtils]: 11: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,029 INFO L280 TraceCheckUtils]: 12: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,030 INFO L280 TraceCheckUtils]: 13: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,030 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {10011#true} {10011#true} #99#return; {10011#true} is VALID [2020-07-11 00:55:29,030 INFO L280 TraceCheckUtils]: 15: Hoare triple {10011#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {10011#true} is VALID [2020-07-11 00:55:29,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {10011#true} ~i~0 := #t~nondet9; {10011#true} is VALID [2020-07-11 00:55:29,031 INFO L280 TraceCheckUtils]: 17: Hoare triple {10011#true} havoc #t~nondet9; {10011#true} is VALID [2020-07-11 00:55:29,031 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-11 00:55:29,032 INFO L280 TraceCheckUtils]: 19: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,032 INFO L280 TraceCheckUtils]: 20: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,032 INFO L280 TraceCheckUtils]: 21: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,032 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {10011#true} {10011#true} #101#return; {10011#true} is VALID [2020-07-11 00:55:29,033 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-11 00:55:29,034 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-11 00:55:29,036 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-11 00:55:29,037 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-11 00:55:29,039 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-11 00:55:29,041 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-11 00:55:29,046 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-11 00:55:29,047 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-11 00:55:29,047 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-11 00:55:29,048 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-11 00:55:29,049 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-11 00:55:29,049 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-11 00:55:29,050 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-11 00:55:29,051 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-11 00:55:29,051 INFO L280 TraceCheckUtils]: 37: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,051 INFO L280 TraceCheckUtils]: 38: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,051 INFO L280 TraceCheckUtils]: 39: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,053 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-11 00:55:29,053 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-11 00:55:29,053 INFO L280 TraceCheckUtils]: 42: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,054 INFO L280 TraceCheckUtils]: 43: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,054 INFO L280 TraceCheckUtils]: 44: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,055 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-11 00:55:29,055 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-11 00:55:29,056 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-11 00:55:29,056 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-11 00:55:29,057 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-11 00:55:29,058 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-11 00:55:29,058 INFO L280 TraceCheckUtils]: 51: 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-11 00:55:29,059 INFO L280 TraceCheckUtils]: 52: 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-11 00:55:29,059 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-11 00:55:29,060 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-11 00:55:29,061 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-11 00:55:29,062 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-11 00:55:29,063 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-11 00:55:29,063 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-11 00:55:29,064 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-11 00:55:29,064 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-11 00:55:29,065 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-11 00:55:29,066 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-11 00:55:29,066 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-11 00:55:29,066 INFO L280 TraceCheckUtils]: 64: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,066 INFO L280 TraceCheckUtils]: 65: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,066 INFO L280 TraceCheckUtils]: 66: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,067 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-11 00:55:29,068 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-11 00:55:29,068 INFO L280 TraceCheckUtils]: 69: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,068 INFO L280 TraceCheckUtils]: 70: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,068 INFO L280 TraceCheckUtils]: 71: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,070 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-11 00:55:29,071 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-11 00:55:29,072 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-11 00:55:29,073 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-11 00:55:29,074 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-11 00:55:29,074 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-11 00:55:29,074 INFO L280 TraceCheckUtils]: 78: Hoare triple {10012#false} havoc #t~mem2; {10012#false} is VALID [2020-07-11 00:55:29,075 INFO L280 TraceCheckUtils]: 79: Hoare triple {10012#false} havoc #t~mem1; {10012#false} is VALID [2020-07-11 00:55:29,075 INFO L280 TraceCheckUtils]: 80: Hoare triple {10012#false} #t~post4 := ~y; {10012#false} is VALID [2020-07-11 00:55:29,075 INFO L280 TraceCheckUtils]: 81: Hoare triple {10012#false} ~y := #t~post4 - 1; {10012#false} is VALID [2020-07-11 00:55:29,075 INFO L280 TraceCheckUtils]: 82: Hoare triple {10012#false} havoc #t~post4; {10012#false} is VALID [2020-07-11 00:55:29,076 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-11 00:55:29,076 INFO L280 TraceCheckUtils]: 84: Hoare triple {10012#false} ~x := #in~x; {10012#false} is VALID [2020-07-11 00:55:29,076 INFO L280 TraceCheckUtils]: 85: Hoare triple {10012#false} ~y := #in~y; {10012#false} is VALID [2020-07-11 00:55:29,076 INFO L280 TraceCheckUtils]: 86: Hoare triple {10012#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10012#false} is VALID [2020-07-11 00:55:29,077 INFO L280 TraceCheckUtils]: 87: Hoare triple {10012#false} ~i := #in~i; {10012#false} is VALID [2020-07-11 00:55:29,077 INFO L280 TraceCheckUtils]: 88: Hoare triple {10012#false} ~n := #in~n; {10012#false} is VALID [2020-07-11 00:55:29,077 INFO L280 TraceCheckUtils]: 89: Hoare triple {10012#false} assume !(~x >= ~y); {10012#false} is VALID [2020-07-11 00:55:29,077 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-11 00:55:29,077 INFO L280 TraceCheckUtils]: 91: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,078 INFO L280 TraceCheckUtils]: 92: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,078 INFO L280 TraceCheckUtils]: 93: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,078 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {10011#true} {10012#false} #109#return; {10012#false} is VALID [2020-07-11 00:55:29,078 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-11 00:55:29,078 INFO L280 TraceCheckUtils]: 96: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-11 00:55:29,079 INFO L280 TraceCheckUtils]: 97: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-11 00:55:29,079 INFO L280 TraceCheckUtils]: 98: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-11 00:55:29,079 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {10011#true} {10012#false} #111#return; {10012#false} is VALID [2020-07-11 00:55:29,079 INFO L280 TraceCheckUtils]: 100: Hoare triple {10012#false} ~x0~0 := ~x; {10012#false} is VALID [2020-07-11 00:55:29,079 INFO L280 TraceCheckUtils]: 101: Hoare triple {10012#false} ~y0~0 := ~y; {10012#false} is VALID [2020-07-11 00:55:29,080 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-11 00:55:29,080 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-11 00:55:29,080 INFO L280 TraceCheckUtils]: 104: Hoare triple {10012#false} assume #t~mem1 <= #t~mem2; {10012#false} is VALID [2020-07-11 00:55:29,080 INFO L280 TraceCheckUtils]: 105: Hoare triple {10012#false} havoc #t~mem2; {10012#false} is VALID [2020-07-11 00:55:29,080 INFO L280 TraceCheckUtils]: 106: Hoare triple {10012#false} havoc #t~mem1; {10012#false} is VALID [2020-07-11 00:55:29,081 INFO L280 TraceCheckUtils]: 107: Hoare triple {10012#false} #t~post3 := ~x; {10012#false} is VALID [2020-07-11 00:55:29,081 INFO L280 TraceCheckUtils]: 108: Hoare triple {10012#false} ~x := 1 + #t~post3; {10012#false} is VALID [2020-07-11 00:55:29,081 INFO L280 TraceCheckUtils]: 109: Hoare triple {10012#false} havoc #t~post3; {10012#false} is VALID [2020-07-11 00:55:29,081 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-11 00:55:29,081 INFO L280 TraceCheckUtils]: 111: Hoare triple {10012#false} ~x := #in~x; {10012#false} is VALID [2020-07-11 00:55:29,081 INFO L280 TraceCheckUtils]: 112: Hoare triple {10012#false} ~y := #in~y; {10012#false} is VALID [2020-07-11 00:55:29,082 INFO L280 TraceCheckUtils]: 113: Hoare triple {10012#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10012#false} is VALID [2020-07-11 00:55:29,082 INFO L280 TraceCheckUtils]: 114: Hoare triple {10012#false} ~i := #in~i; {10012#false} is VALID [2020-07-11 00:55:29,082 INFO L280 TraceCheckUtils]: 115: Hoare triple {10012#false} ~n := #in~n; {10012#false} is VALID [2020-07-11 00:55:29,082 INFO L280 TraceCheckUtils]: 116: Hoare triple {10012#false} assume !(~x >= ~y); {10012#false} is VALID [2020-07-11 00:55:29,082 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-11 00:55:29,082 INFO L280 TraceCheckUtils]: 118: Hoare triple {10012#false} ~cond := #in~cond; {10012#false} is VALID [2020-07-11 00:55:29,083 INFO L280 TraceCheckUtils]: 119: Hoare triple {10012#false} assume 0 == ~cond; {10012#false} is VALID [2020-07-11 00:55:29,083 INFO L280 TraceCheckUtils]: 120: Hoare triple {10012#false} assume !false; {10012#false} is VALID [2020-07-11 00:55:29,100 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-07-11 00:55:29,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [533856669] [2020-07-11 00:55:29,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:55:29,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 00:55:29,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573012857] [2020-07-11 00:55:29,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-07-11 00:55:29,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:55:29,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 00:55:29,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:55:29,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 00:55:29,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:55:29,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 00:55:29,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:55:29,206 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 11 states. [2020-07-11 00:55:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:30,692 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-07-11 00:55:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 00:55:30,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-07-11 00:55:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:55:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:55:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2020-07-11 00:55:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:55:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2020-07-11 00:55:30,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2020-07-11 00:55:30,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:55:30,832 INFO L225 Difference]: With dead ends: 163 [2020-07-11 00:55:30,832 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:55:30,833 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-11 00:55:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:55:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:55:30,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:55:30,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:55:30,834 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:55:30,834 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:55:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:30,835 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:55:30,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:55:30,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:30,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:55:30,835 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:55:30,836 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:55:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:55:30,836 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:55:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:55:30,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:30,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:55:30,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:55:30,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:55:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:55:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:55:30,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-07-11 00:55:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:55:30,837 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:55:30,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 00:55:30,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:55:30,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:55:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:55:30,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:55:30,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 00:55:30,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:55:33,577 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-07-11 00:55:33,794 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-11 00:55:34,153 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-07-11 00:55:34,440 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-11 00:55:34,639 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-11 00:55:34,884 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-07-11 00:55:35,198 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-11 00:55:35,529 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-11 00:55:35,911 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-11 00:55:36,280 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-07-11 00:55:36,662 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2020-07-11 00:55:36,862 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-11 00:55:37,221 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-07-11 00:55:37,481 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2020-07-11 00:55:37,922 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-07-11 00:55:38,326 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-11 00:55:38,686 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-07-11 00:55:38,909 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-11 00:55:39,199 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-11 00:55:39,484 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-11 00:55:39,862 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-11 00:55:40,181 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-11 00:55:40,409 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-07-11 00:55:40,548 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 25 [2020-07-11 00:55:40,911 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-11 00:55:41,164 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-11 00:55:41,579 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-11 00:55:41,936 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-11 00:55:42,258 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-11 00:55:42,489 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2020-07-11 00:55:42,527 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:55:42,527 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-11 00:55:42,527 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:55:42,528 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-11 00:55:42,528 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:55:42,528 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:55:42,528 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:55:42,528 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:55:42,528 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:55:42,528 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-11 00:55:42,528 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-11 00:55:42,529 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-11 00:55:42,529 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-11 00:55:42,529 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-11 00:55:42,529 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-07-11 00:55:42,529 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-11 00:55:42,529 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= main_~ai~1 main_~ax~1) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,530 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-07-11 00:55:42,530 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,530 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,530 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-07-11 00:55:42,530 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-11 00:55:42,530 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= |main_#t~mem12| 0) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,530 INFO L264 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|)) [2020-07-11 00:55:42,530 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,531 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,531 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,531 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,531 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,531 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,531 INFO L264 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (<= main_~ai~1 main_~ax~1) (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= 0 main_~ai~1) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,531 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,531 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,532 INFO L264 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,532 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,532 INFO L264 CegarLoopResult]: At program point L45-3(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:55:42,532 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,532 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,532 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,532 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:55:42,533 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-11 00:55:42,533 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= 0 check_~ax~0) (= 0 check_~ai~0) (= .cse0 (select |#memory_int| check_~a.base))) (not (<= 1 |check_#in~x|)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-11 00:55:42,533 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-07-11 00:55:42,533 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:55:42,533 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 |check_#t~mem6|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse2 .cse3) (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:55:42,533 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= 0 |check_#t~mem6|)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-11 00:55:42,534 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:55:42,534 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:55:42,534 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:55:42,534 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:55:42,534 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:55:42,534 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:55:42,535 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-11 00:55:42,535 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-11 00:55:42,535 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse0 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse1 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 (= .cse1 (select |#memory_int| check_~a.base)) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or (and .cse0 (= 0 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:55:42,535 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-11 00:55:42,535 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))))) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse3 .cse4)))) [2020-07-11 00:55:42,535 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 .cse3) .cse4) (or (and .cse1 .cse2 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x)))) .cse3) .cse0 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:55:42,536 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 .cse3) (not (<= 1 |check_#in~x|)) .cse4 .cse5) (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x)))) .cse3) .cse4 .cse5 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:55:42,536 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-11 00:55:42,536 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse9 |check_#in~n|)) (.cse5 (= .cse8 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse9 check_~n)) (.cse7 (= 0 |check_#t~mem1|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse8 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse2 .cse1) (or (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (and .cse4 .cse5 (<= 1 check_~x) .cse6 .cse7) (not (<= 1 |check_#in~x|)) .cse0 .cse1)))) [2020-07-11 00:55:42,536 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-11 00:55:42,537 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse10 |check_#in~n|)) (.cse5 (= .cse9 (select |#memory_int| check_~a.base))) (.cse6 (<= .cse10 check_~n)) (.cse7 (= 0 |check_#t~mem1|)) (.cse8 (= 0 |check_#t~mem2|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse9 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n))) .cse2 .cse1) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse4 .cse5 (<= 1 check_~x) .cse6 .cse7 .cse8) .cse1) (or (and .cse4 (= 0 check_~x) .cse5 .cse6 .cse7 .cse8) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:55:42,537 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (= .cse7 (select |#memory_int| check_~a.base))) (.cse5 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse2 .cse1) (or (and .cse3 (= 0 check_~x) .cse4 .cse5 (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|)) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:55:42,537 INFO L264 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (= .cse7 (select |#memory_int| check_~a.base))) (.cse5 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse2 .cse1) (or (and .cse3 (= 0 check_~x) .cse4 .cse5 (= 0 |check_#t~mem1|)) .cse0 .cse1 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:55:42,538 INFO L264 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-11 00:55:42,538 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-11 00:55:42,538 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-11 00:55:42,538 INFO L264 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (<= .cse8 |check_#in~n|)) (.cse1 (= .cse7 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse8 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse4 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or .cse3 .cse4 .cse5 (<= 2 check_~x)) (or (and (= 0 |check_#t~post3|) .cse0 (= 0 check_~x) .cse1 .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse4)))) [2020-07-11 00:55:42,539 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse8 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or .cse0 .cse1 .cse5 (<= 2 check_~x)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n))) .cse5 .cse1)))) [2020-07-11 00:55:42,539 INFO L264 CegarLoopResult]: At program point L24-7(line 24) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (<= .cse7 |check_#in~n|)) (.cse1 (= .cse6 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse7 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and (= 0 |check_#t~post3|) .cse0 .cse1 (<= 1 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse3 .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n))) (not (<= 2 |check_#in~x|)) .cse4)))) [2020-07-11 00:55:42,539 INFO L264 CegarLoopResult]: At program point L24-9(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:55:42,539 INFO L264 CegarLoopResult]: At program point L14(lines 14 36) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (= 0 check_~x) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) (<= 1 check_~x) .cse0 .cse1))) [2020-07-11 00:55:42,539 INFO L264 CegarLoopResult]: At program point L24-10(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:55:42,540 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 36) the Hoare annotation is: (let ((.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x)) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (and .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse0 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|)))) [2020-07-11 00:55:42,540 INFO L264 CegarLoopResult]: At program point L24-11(lines 24 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (<= .cse6 |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse6 check_~n)) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse3 (and .cse0 .cse1 .cse2 (<= 2 check_~x)) .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) (not (<= 2 |check_#in~x|)) .cse4 (<= (+ check_~y 2) check_~n))))) [2020-07-11 00:55:42,540 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x) .cse4) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-11 00:55:42,540 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (not (<= 2 |check_#in~x|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (= 0 check_~x) .cse4) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse3 .cse4 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (<= (+ check_~y 2) |check_#in~n|))))) [2020-07-11 00:55:42,541 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-11 00:55:42,541 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 00:55:42,541 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 00:55:42,541 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 00:55:42,541 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 00:55:42,541 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 00:55:42,542 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-11 00:55:42,542 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-11 00:55:42,542 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-11 00:55:42,607 INFO L163 areAnnotationChecker]: CFG has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:55:42,620 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) 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-11 00:55:42,625 INFO L168 Benchmark]: Toolchain (without parser) took 80516.00 ms. Allocated memory was 139.5 MB in the beginning and 544.2 MB in the end (delta: 404.8 MB). Free memory was 104.4 MB in the beginning and 285.7 MB in the end (delta: -181.3 MB). Peak memory consumption was 223.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:55:42,626 INFO L168 Benchmark]: CDTParser took 0.21 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-11 00:55:42,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.97 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 92.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:55:42,627 INFO L168 Benchmark]: Boogie Preprocessor took 146.84 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.8 MB in the beginning and 181.4 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-11 00:55:42,628 INFO L168 Benchmark]: RCFGBuilder took 623.33 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 144.0 MB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:55:42,628 INFO L168 Benchmark]: TraceAbstraction took 79388.87 ms. Allocated memory was 203.9 MB in the beginning and 544.2 MB in the end (delta: 340.3 MB). Free memory was 144.0 MB in the beginning and 285.7 MB in the end (delta: -141.7 MB). Peak memory consumption was 198.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:55:42,639 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.21 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 350.97 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 92.8 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.84 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.8 MB in the beginning and 181.4 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 623.33 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 144.0 MB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 79388.87 ms. Allocated memory was 203.9 MB in the beginning and 544.2 MB in the end (delta: 340.3 MB). Free memory was 144.0 MB in the beginning and 285.7 MB in the end (delta: -141.7 MB). Peak memory consumption was 198.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...