/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-267fbe0 [2020-07-18 05:00:04,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 05:00:04,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 05:00:04,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 05:00:04,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 05:00:04,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 05:00:04,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 05:00:04,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 05:00:04,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 05:00:04,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 05:00:04,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 05:00:04,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 05:00:04,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 05:00:04,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 05:00:04,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 05:00:04,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 05:00:04,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 05:00:04,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 05:00:04,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 05:00:04,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 05:00:04,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 05:00:04,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 05:00:04,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 05:00:04,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 05:00:04,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 05:00:04,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 05:00:04,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 05:00:04,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 05:00:04,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 05:00:04,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 05:00:04,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 05:00:04,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 05:00:04,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 05:00:04,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 05:00:04,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 05:00:04,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 05:00:04,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 05:00:04,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 05:00:04,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 05:00:04,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 05:00:04,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 05:00:04,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 05:00:04,525 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 05:00:04,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 05:00:04,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 05:00:04,527 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 05:00:04,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 05:00:04,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 05:00:04,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 05:00:04,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 05:00:04,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 05:00:04,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 05:00:04,529 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 05:00:04,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 05:00:04,530 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 05:00:04,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 05:00:04,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 05:00:04,531 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 05:00:04,531 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 05:00:04,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 05:00:04,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:00:04,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 05:00:04,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 05:00:04,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 05:00:04,532 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-18 05:00:04,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 05:00:04,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 05:00:04,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 05:00:04,809 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 05:00:04,809 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 05:00:04,810 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-18 05:00:04,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc99cdc4f/def1eef0ecaf4198b201628d63fa0025/FLAG4c2188a84 [2020-07-18 05:00:05,341 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 05:00:05,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-07-18 05:00:05,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc99cdc4f/def1eef0ecaf4198b201628d63fa0025/FLAG4c2188a84 [2020-07-18 05:00:05,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc99cdc4f/def1eef0ecaf4198b201628d63fa0025 [2020-07-18 05:00:05,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 05:00:05,725 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 05:00:05,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 05:00:05,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 05:00:05,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 05:00:05,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:00:05" (1/1) ... [2020-07-18 05:00:05,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2e350c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:05, skipping insertion in model container [2020-07-18 05:00:05,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 05:00:05" (1/1) ... [2020-07-18 05:00:05,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 05:00:05,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 05:00:06,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:00:06,074 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 05:00:06,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 05:00:06,229 INFO L208 MainTranslator]: Completed translation [2020-07-18 05:00:06,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06 WrapperNode [2020-07-18 05:00:06,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 05:00:06,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 05:00:06,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 05:00:06,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 05:00:06,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (1/1) ... [2020-07-18 05:00:06,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (1/1) ... [2020-07-18 05:00:06,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (1/1) ... [2020-07-18 05:00:06,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (1/1) ... [2020-07-18 05:00:06,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (1/1) ... [2020-07-18 05:00:06,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (1/1) ... [2020-07-18 05:00:06,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (1/1) ... [2020-07-18 05:00:06,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 05:00:06,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 05:00:06,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 05:00:06,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 05:00:06,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 05:00:06,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 05:00:06,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 05:00:06,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 05:00:06,344 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 05:00:06,345 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-18 05:00:06,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 05:00:06,345 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-18 05:00:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 05:00:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 05:00:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 05:00:06,345 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 05:00:06,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 05:00:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 05:00:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 05:00:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-18 05:00:06,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 05:00:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 05:00:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 05:00:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-18 05:00:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 05:00:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 05:00:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 05:00:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 05:00:06,866 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 05:00:06,867 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 05:00:06,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:00:06 BoogieIcfgContainer [2020-07-18 05:00:06,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 05:00:06,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 05:00:06,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 05:00:06,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 05:00:06,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 05:00:05" (1/3) ... [2020-07-18 05:00:06,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38da39e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:00:06, skipping insertion in model container [2020-07-18 05:00:06,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 05:00:06" (2/3) ... [2020-07-18 05:00:06,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38da39e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 05:00:06, skipping insertion in model container [2020-07-18 05:00:06,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 05:00:06" (3/3) ... [2020-07-18 05:00:06,881 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-07-18 05:00:06,892 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 05:00:06,901 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 05:00:06,915 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 05:00:06,937 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 05:00:06,938 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 05:00:06,938 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 05:00:06,938 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 05:00:06,939 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 05:00:06,939 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 05:00:06,939 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 05:00:06,939 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 05:00:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-18 05:00:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-18 05:00:06,973 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:06,974 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:06,975 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-07-18 05:00:06,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:06,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520153611] [2020-07-18 05:00:06,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:07,436 INFO L280 TraceCheckUtils]: 0: Hoare triple {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {90#true} is VALID [2020-07-18 05:00:07,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} #valid := #valid[0 := 0]; {90#true} is VALID [2020-07-18 05:00:07,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume 0 < #StackHeapBarrier; {90#true} is VALID [2020-07-18 05:00:07,438 INFO L280 TraceCheckUtils]: 3: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 05:00:07,438 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {90#true} {90#true} #117#return; {90#true} is VALID [2020-07-18 05:00:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:07,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-18 05:00:07,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-18 05:00:07,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 05:00:07,452 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #99#return; {90#true} is VALID [2020-07-18 05:00:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:07,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-18 05:00:07,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-18 05:00:07,460 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 05:00:07,460 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #101#return; {90#true} is VALID [2020-07-18 05:00:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:07,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {90#true} is VALID [2020-07-18 05:00:07,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 05:00:07,484 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #103#return; {90#true} is VALID [2020-07-18 05:00:07,486 INFO L263 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:07,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {114#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {90#true} is VALID [2020-07-18 05:00:07,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} #valid := #valid[0 := 0]; {90#true} is VALID [2020-07-18 05:00:07,487 INFO L280 TraceCheckUtils]: 3: Hoare triple {90#true} assume 0 < #StackHeapBarrier; {90#true} is VALID [2020-07-18 05:00:07,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 05:00:07,488 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {90#true} {90#true} #117#return; {90#true} is VALID [2020-07-18 05:00:07,489 INFO L263 TraceCheckUtils]: 6: Hoare triple {90#true} call #t~ret14 := main(); {90#true} is VALID [2020-07-18 05:00:07,489 INFO L280 TraceCheckUtils]: 7: Hoare triple {90#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {90#true} is VALID [2020-07-18 05:00:07,490 INFO L280 TraceCheckUtils]: 8: Hoare triple {90#true} ~n~0 := #t~nondet8; {90#true} is VALID [2020-07-18 05:00:07,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {90#true} havoc #t~nondet8; {90#true} is VALID [2020-07-18 05:00:07,490 INFO L263 TraceCheckUtils]: 10: Hoare triple {90#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {90#true} is VALID [2020-07-18 05:00:07,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-18 05:00:07,491 INFO L280 TraceCheckUtils]: 12: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-18 05:00:07,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 05:00:07,492 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {90#true} {90#true} #99#return; {90#true} is VALID [2020-07-18 05:00:07,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {90#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {90#true} is VALID [2020-07-18 05:00:07,493 INFO L280 TraceCheckUtils]: 16: Hoare triple {90#true} ~i~0 := #t~nondet9; {90#true} is VALID [2020-07-18 05:00:07,493 INFO L280 TraceCheckUtils]: 17: Hoare triple {90#true} havoc #t~nondet9; {90#true} is VALID [2020-07-18 05:00:07,493 INFO L263 TraceCheckUtils]: 18: Hoare triple {90#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {90#true} is VALID [2020-07-18 05:00:07,494 INFO L280 TraceCheckUtils]: 19: Hoare triple {90#true} ~cond := #in~cond; {90#true} is VALID [2020-07-18 05:00:07,494 INFO L280 TraceCheckUtils]: 20: Hoare triple {90#true} assume !(0 == ~cond); {90#true} is VALID [2020-07-18 05:00:07,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 05:00:07,495 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {90#true} {90#true} #101#return; {90#true} is VALID [2020-07-18 05:00:07,495 INFO L280 TraceCheckUtils]: 23: Hoare triple {90#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {90#true} is VALID [2020-07-18 05:00:07,498 INFO L263 TraceCheckUtils]: 24: Hoare triple {90#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {115#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:07,498 INFO L280 TraceCheckUtils]: 25: Hoare triple {115#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {90#true} is VALID [2020-07-18 05:00:07,498 INFO L280 TraceCheckUtils]: 26: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-18 05:00:07,499 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {90#true} {90#true} #103#return; {90#true} is VALID [2020-07-18 05:00:07,499 INFO L280 TraceCheckUtils]: 28: Hoare triple {90#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {90#true} is VALID [2020-07-18 05:00:07,501 INFO L263 TraceCheckUtils]: 29: Hoare triple {90#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {108#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 05:00:07,503 INFO L280 TraceCheckUtils]: 30: Hoare triple {108#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {109#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:07,504 INFO L280 TraceCheckUtils]: 31: Hoare triple {109#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:07,505 INFO L280 TraceCheckUtils]: 32: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:07,506 INFO L280 TraceCheckUtils]: 33: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:07,508 INFO L280 TraceCheckUtils]: 34: Hoare triple {110#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:07,509 INFO L280 TraceCheckUtils]: 35: Hoare triple {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:07,510 INFO L263 TraceCheckUtils]: 36: Hoare triple {111#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {112#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:07,511 INFO L280 TraceCheckUtils]: 37: Hoare triple {112#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {113#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:07,512 INFO L280 TraceCheckUtils]: 38: Hoare triple {113#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {91#false} is VALID [2020-07-18 05:00:07,513 INFO L280 TraceCheckUtils]: 39: Hoare triple {91#false} assume !false; {91#false} is VALID [2020-07-18 05:00:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-18 05:00:07,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520153611] [2020-07-18 05:00:07,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:00:07,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 05:00:07,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545812873] [2020-07-18 05:00:07,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-18 05:00:07,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:07,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 05:00:07,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:07,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 05:00:07,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 05:00:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-18 05:00:07,626 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-07-18 05:00:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:10,616 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-07-18 05:00:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 05:00:10,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-07-18 05:00:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:00:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 05:00:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2020-07-18 05:00:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 05:00:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 257 transitions. [2020-07-18 05:00:10,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 257 transitions. [2020-07-18 05:00:11,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:11,056 INFO L225 Difference]: With dead ends: 221 [2020-07-18 05:00:11,059 INFO L226 Difference]: Without dead ends: 138 [2020-07-18 05:00:11,069 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-18 05:00:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-18 05:00:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-07-18 05:00:11,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:00:11,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 122 states. [2020-07-18 05:00:11,414 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 122 states. [2020-07-18 05:00:11,414 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 122 states. [2020-07-18 05:00:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:11,431 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-18 05:00:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-07-18 05:00:11,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:11,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:11,435 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 138 states. [2020-07-18 05:00:11,435 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 138 states. [2020-07-18 05:00:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:11,447 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2020-07-18 05:00:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2020-07-18 05:00:11,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:11,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:11,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:00:11,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:00:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-18 05:00:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-07-18 05:00:11,459 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-07-18 05:00:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:00:11,460 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-07-18 05:00:11,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 05:00:11,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 122 states and 132 transitions. [2020-07-18 05:00:11,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-07-18 05:00:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 05:00:11,665 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:11,668 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:11,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 05:00:11,669 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-07-18 05:00:11,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:11,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1247747086] [2020-07-18 05:00:11,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:11,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1097#true} is VALID [2020-07-18 05:00:11,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} #valid := #valid[0 := 0]; {1097#true} is VALID [2020-07-18 05:00:11,924 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume 0 < #StackHeapBarrier; {1097#true} is VALID [2020-07-18 05:00:11,924 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 05:00:11,924 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2020-07-18 05:00:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:11,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-18 05:00:11,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-18 05:00:11,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 05:00:11,930 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #99#return; {1097#true} is VALID [2020-07-18 05:00:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:11,935 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-18 05:00:11,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-18 05:00:11,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 05:00:11,936 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1097#true} {1097#true} #101#return; {1097#true} is VALID [2020-07-18 05:00:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:11,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {1133#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:00:11,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:00:11,973 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1097#true} #103#return; {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 05:00:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:11,988 INFO L280 TraceCheckUtils]: 0: Hoare triple {1097#true} ~x := #in~x; {1097#true} is VALID [2020-07-18 05:00:11,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {1097#true} ~y := #in~y; {1097#true} is VALID [2020-07-18 05:00:11,988 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1097#true} is VALID [2020-07-18 05:00:11,989 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} ~i := #in~i; {1097#true} is VALID [2020-07-18 05:00:11,989 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#true} ~n := #in~n; {1097#true} is VALID [2020-07-18 05:00:11,989 INFO L280 TraceCheckUtils]: 5: Hoare triple {1097#true} assume ~x >= ~y; {1097#true} is VALID [2020-07-18 05:00:11,990 INFO L280 TraceCheckUtils]: 6: Hoare triple {1097#true} #res := ~x; {1097#true} is VALID [2020-07-18 05:00:11,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 05:00:11,992 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1097#true} {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} #105#return; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 05:00:11,993 INFO L263 TraceCheckUtils]: 0: Hoare triple {1097#true} call ULTIMATE.init(); {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:11,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {1132#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1097#true} is VALID [2020-07-18 05:00:11,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {1097#true} #valid := #valid[0 := 0]; {1097#true} is VALID [2020-07-18 05:00:11,994 INFO L280 TraceCheckUtils]: 3: Hoare triple {1097#true} assume 0 < #StackHeapBarrier; {1097#true} is VALID [2020-07-18 05:00:11,994 INFO L280 TraceCheckUtils]: 4: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 05:00:11,994 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1097#true} {1097#true} #117#return; {1097#true} is VALID [2020-07-18 05:00:11,994 INFO L263 TraceCheckUtils]: 6: Hoare triple {1097#true} call #t~ret14 := main(); {1097#true} is VALID [2020-07-18 05:00:11,995 INFO L280 TraceCheckUtils]: 7: Hoare triple {1097#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1097#true} is VALID [2020-07-18 05:00:11,995 INFO L280 TraceCheckUtils]: 8: Hoare triple {1097#true} ~n~0 := #t~nondet8; {1097#true} is VALID [2020-07-18 05:00:11,995 INFO L280 TraceCheckUtils]: 9: Hoare triple {1097#true} havoc #t~nondet8; {1097#true} is VALID [2020-07-18 05:00:11,995 INFO L263 TraceCheckUtils]: 10: Hoare triple {1097#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1097#true} is VALID [2020-07-18 05:00:11,996 INFO L280 TraceCheckUtils]: 11: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-18 05:00:11,996 INFO L280 TraceCheckUtils]: 12: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-18 05:00:11,996 INFO L280 TraceCheckUtils]: 13: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 05:00:11,997 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1097#true} {1097#true} #99#return; {1097#true} is VALID [2020-07-18 05:00:11,997 INFO L280 TraceCheckUtils]: 15: Hoare triple {1097#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1097#true} is VALID [2020-07-18 05:00:11,997 INFO L280 TraceCheckUtils]: 16: Hoare triple {1097#true} ~i~0 := #t~nondet9; {1097#true} is VALID [2020-07-18 05:00:11,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {1097#true} havoc #t~nondet9; {1097#true} is VALID [2020-07-18 05:00:11,998 INFO L263 TraceCheckUtils]: 18: Hoare triple {1097#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1097#true} is VALID [2020-07-18 05:00:11,998 INFO L280 TraceCheckUtils]: 19: Hoare triple {1097#true} ~cond := #in~cond; {1097#true} is VALID [2020-07-18 05:00:11,998 INFO L280 TraceCheckUtils]: 20: Hoare triple {1097#true} assume !(0 == ~cond); {1097#true} is VALID [2020-07-18 05:00:11,999 INFO L280 TraceCheckUtils]: 21: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 05:00:11,999 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1097#true} {1097#true} #101#return; {1097#true} is VALID [2020-07-18 05:00:11,999 INFO L280 TraceCheckUtils]: 23: Hoare triple {1097#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {1097#true} is VALID [2020-07-18 05:00:12,001 INFO L263 TraceCheckUtils]: 24: Hoare triple {1097#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1133#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:12,002 INFO L280 TraceCheckUtils]: 25: Hoare triple {1133#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:00:12,002 INFO L280 TraceCheckUtils]: 26: Hoare triple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:00:12,004 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1134#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {1097#true} #103#return; {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 05:00:12,005 INFO L280 TraceCheckUtils]: 28: Hoare triple {1115#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 05:00:12,005 INFO L263 TraceCheckUtils]: 29: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1097#true} is VALID [2020-07-18 05:00:12,005 INFO L280 TraceCheckUtils]: 30: Hoare triple {1097#true} ~x := #in~x; {1097#true} is VALID [2020-07-18 05:00:12,005 INFO L280 TraceCheckUtils]: 31: Hoare triple {1097#true} ~y := #in~y; {1097#true} is VALID [2020-07-18 05:00:12,006 INFO L280 TraceCheckUtils]: 32: Hoare triple {1097#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1097#true} is VALID [2020-07-18 05:00:12,006 INFO L280 TraceCheckUtils]: 33: Hoare triple {1097#true} ~i := #in~i; {1097#true} is VALID [2020-07-18 05:00:12,006 INFO L280 TraceCheckUtils]: 34: Hoare triple {1097#true} ~n := #in~n; {1097#true} is VALID [2020-07-18 05:00:12,007 INFO L280 TraceCheckUtils]: 35: Hoare triple {1097#true} assume ~x >= ~y; {1097#true} is VALID [2020-07-18 05:00:12,007 INFO L280 TraceCheckUtils]: 36: Hoare triple {1097#true} #res := ~x; {1097#true} is VALID [2020-07-18 05:00:12,007 INFO L280 TraceCheckUtils]: 37: Hoare triple {1097#true} assume true; {1097#true} is VALID [2020-07-18 05:00:12,009 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1097#true} {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} #105#return; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 05:00:12,009 INFO L280 TraceCheckUtils]: 39: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 05:00:12,010 INFO L280 TraceCheckUtils]: 40: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} ~x~0 := #t~ret11; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 05:00:12,011 INFO L280 TraceCheckUtils]: 41: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} havoc #t~ret11; {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 05:00:12,011 INFO L280 TraceCheckUtils]: 42: Hoare triple {1116#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} SUMMARY for call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L46 {1126#(and (= |main_#t~mem12| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-18 05:00:12,012 INFO L280 TraceCheckUtils]: 43: Hoare triple {1126#(and (= |main_#t~mem12| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} ~ai~1 := #t~mem12; {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-18 05:00:12,013 INFO L280 TraceCheckUtils]: 44: Hoare triple {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} havoc #t~mem12; {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} is VALID [2020-07-18 05:00:12,014 INFO L280 TraceCheckUtils]: 45: Hoare triple {1127#(and (= 0 main_~ai~1) (= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base)))} SUMMARY for call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); srcloc: L47 {1128#(and (= |main_#t~mem13| 0) (= 0 main_~ai~1))} is VALID [2020-07-18 05:00:12,015 INFO L280 TraceCheckUtils]: 46: Hoare triple {1128#(and (= |main_#t~mem13| 0) (= 0 main_~ai~1))} ~ax~1 := #t~mem13; {1129#(<= main_~ai~1 main_~ax~1)} is VALID [2020-07-18 05:00:12,015 INFO L280 TraceCheckUtils]: 47: Hoare triple {1129#(<= main_~ai~1 main_~ax~1)} havoc #t~mem13; {1129#(<= main_~ai~1 main_~ax~1)} is VALID [2020-07-18 05:00:12,016 INFO L263 TraceCheckUtils]: 48: Hoare triple {1129#(<= main_~ai~1 main_~ax~1)} call __VERIFIER_assert((if ~ai~1 <= ~ax~1 then 1 else 0)); {1130#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:12,017 INFO L280 TraceCheckUtils]: 49: Hoare triple {1130#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1131#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:12,018 INFO L280 TraceCheckUtils]: 50: Hoare triple {1131#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1098#false} is VALID [2020-07-18 05:00:12,018 INFO L280 TraceCheckUtils]: 51: Hoare triple {1098#false} assume !false; {1098#false} is VALID [2020-07-18 05:00:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-18 05:00:12,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1247747086] [2020-07-18 05:00:12,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:00:12,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-18 05:00:12,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707212848] [2020-07-18 05:00:12,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-18 05:00:12,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:12,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 05:00:12,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:12,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 05:00:12,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 05:00:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-18 05:00:12,082 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-07-18 05:00:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:14,671 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-18 05:00:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-18 05:00:14,671 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-07-18 05:00:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:00:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 05:00:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2020-07-18 05:00:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 05:00:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 91 transitions. [2020-07-18 05:00:14,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 91 transitions. [2020-07-18 05:00:14,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:14,797 INFO L225 Difference]: With dead ends: 128 [2020-07-18 05:00:14,798 INFO L226 Difference]: Without dead ends: 108 [2020-07-18 05:00:14,799 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-18 05:00:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-18 05:00:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-07-18 05:00:15,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:00:15,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 108 states. [2020-07-18 05:00:15,043 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2020-07-18 05:00:15,043 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2020-07-18 05:00:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:15,057 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-18 05:00:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-18 05:00:15,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:15,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:15,067 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2020-07-18 05:00:15,067 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2020-07-18 05:00:15,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:15,076 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2020-07-18 05:00:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-18 05:00:15,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:15,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:15,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:00:15,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:00:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-18 05:00:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-07-18 05:00:15,092 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-07-18 05:00:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:00:15,094 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-07-18 05:00:15,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 05:00:15,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 116 transitions. [2020-07-18 05:00:15,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-07-18 05:00:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 05:00:15,251 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:15,251 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:15,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 05:00:15,252 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-07-18 05:00:15,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:15,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [699547458] [2020-07-18 05:00:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:15,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1850#true} is VALID [2020-07-18 05:00:15,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} #valid := #valid[0 := 0]; {1850#true} is VALID [2020-07-18 05:00:15,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume 0 < #StackHeapBarrier; {1850#true} is VALID [2020-07-18 05:00:15,587 INFO L280 TraceCheckUtils]: 3: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,587 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1850#true} {1850#true} #117#return; {1850#true} is VALID [2020-07-18 05:00:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:15,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 05:00:15,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 05:00:15,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,595 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #99#return; {1850#true} is VALID [2020-07-18 05:00:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:15,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 05:00:15,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 05:00:15,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,601 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1850#true} #101#return; {1850#true} is VALID [2020-07-18 05:00:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:15,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {1888#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1850#true} is VALID [2020-07-18 05:00:15,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,630 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1850#true} {1850#true} #103#return; {1850#true} is VALID [2020-07-18 05:00:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:15,643 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 05:00:15,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 05:00:15,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,645 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:15,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 05:00:15,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 05:00:15,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,662 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,664 INFO L263 TraceCheckUtils]: 0: Hoare triple {1850#true} call ULTIMATE.init(); {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:15,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {1887#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1850#true} is VALID [2020-07-18 05:00:15,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {1850#true} #valid := #valid[0 := 0]; {1850#true} is VALID [2020-07-18 05:00:15,665 INFO L280 TraceCheckUtils]: 3: Hoare triple {1850#true} assume 0 < #StackHeapBarrier; {1850#true} is VALID [2020-07-18 05:00:15,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,666 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1850#true} {1850#true} #117#return; {1850#true} is VALID [2020-07-18 05:00:15,667 INFO L263 TraceCheckUtils]: 6: Hoare triple {1850#true} call #t~ret14 := main(); {1850#true} is VALID [2020-07-18 05:00:15,667 INFO L280 TraceCheckUtils]: 7: Hoare triple {1850#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1850#true} is VALID [2020-07-18 05:00:15,667 INFO L280 TraceCheckUtils]: 8: Hoare triple {1850#true} ~n~0 := #t~nondet8; {1850#true} is VALID [2020-07-18 05:00:15,668 INFO L280 TraceCheckUtils]: 9: Hoare triple {1850#true} havoc #t~nondet8; {1850#true} is VALID [2020-07-18 05:00:15,668 INFO L263 TraceCheckUtils]: 10: Hoare triple {1850#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {1850#true} is VALID [2020-07-18 05:00:15,668 INFO L280 TraceCheckUtils]: 11: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 05:00:15,669 INFO L280 TraceCheckUtils]: 12: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 05:00:15,669 INFO L280 TraceCheckUtils]: 13: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,669 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1850#true} {1850#true} #99#return; {1850#true} is VALID [2020-07-18 05:00:15,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {1850#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1850#true} is VALID [2020-07-18 05:00:15,670 INFO L280 TraceCheckUtils]: 16: Hoare triple {1850#true} ~i~0 := #t~nondet9; {1850#true} is VALID [2020-07-18 05:00:15,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {1850#true} havoc #t~nondet9; {1850#true} is VALID [2020-07-18 05:00:15,670 INFO L263 TraceCheckUtils]: 18: Hoare triple {1850#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {1850#true} is VALID [2020-07-18 05:00:15,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 05:00:15,671 INFO L280 TraceCheckUtils]: 20: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 05:00:15,671 INFO L280 TraceCheckUtils]: 21: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,671 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1850#true} {1850#true} #101#return; {1850#true} is VALID [2020-07-18 05:00:15,672 INFO L280 TraceCheckUtils]: 23: Hoare triple {1850#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {1850#true} is VALID [2020-07-18 05:00:15,673 INFO L263 TraceCheckUtils]: 24: Hoare triple {1850#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1888#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:15,673 INFO L280 TraceCheckUtils]: 25: Hoare triple {1888#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1850#true} is VALID [2020-07-18 05:00:15,674 INFO L280 TraceCheckUtils]: 26: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,674 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1850#true} {1850#true} #103#return; {1850#true} is VALID [2020-07-18 05:00:15,674 INFO L280 TraceCheckUtils]: 28: Hoare triple {1850#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {1850#true} is VALID [2020-07-18 05:00:15,676 INFO L263 TraceCheckUtils]: 29: Hoare triple {1850#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {1868#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 05:00:15,677 INFO L280 TraceCheckUtils]: 30: Hoare triple {1868#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {1869#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:15,677 INFO L280 TraceCheckUtils]: 31: Hoare triple {1869#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:15,678 INFO L280 TraceCheckUtils]: 32: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:15,680 INFO L280 TraceCheckUtils]: 33: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:15,682 INFO L280 TraceCheckUtils]: 34: Hoare triple {1870#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,683 INFO L280 TraceCheckUtils]: 35: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,684 INFO L263 TraceCheckUtils]: 36: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1850#true} is VALID [2020-07-18 05:00:15,696 INFO L280 TraceCheckUtils]: 37: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 05:00:15,697 INFO L280 TraceCheckUtils]: 38: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 05:00:15,697 INFO L280 TraceCheckUtils]: 39: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,698 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,699 INFO L263 TraceCheckUtils]: 41: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {1850#true} is VALID [2020-07-18 05:00:15,699 INFO L280 TraceCheckUtils]: 42: Hoare triple {1850#true} ~cond := #in~cond; {1850#true} is VALID [2020-07-18 05:00:15,699 INFO L280 TraceCheckUtils]: 43: Hoare triple {1850#true} assume !(0 == ~cond); {1850#true} is VALID [2020-07-18 05:00:15,699 INFO L280 TraceCheckUtils]: 44: Hoare triple {1850#true} assume true; {1850#true} is VALID [2020-07-18 05:00:15,700 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1850#true} {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,701 INFO L280 TraceCheckUtils]: 46: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,702 INFO L280 TraceCheckUtils]: 47: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,703 INFO L280 TraceCheckUtils]: 48: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,704 INFO L280 TraceCheckUtils]: 49: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,704 INFO L280 TraceCheckUtils]: 50: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,706 INFO L280 TraceCheckUtils]: 51: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,707 INFO L280 TraceCheckUtils]: 52: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,709 INFO L280 TraceCheckUtils]: 53: Hoare triple {1871#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {1880#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:15,710 INFO L280 TraceCheckUtils]: 54: Hoare triple {1880#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:15,711 INFO L280 TraceCheckUtils]: 55: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:15,713 INFO L263 TraceCheckUtils]: 56: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {1882#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:15,714 INFO L280 TraceCheckUtils]: 57: Hoare triple {1882#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {1883#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:15,714 INFO L280 TraceCheckUtils]: 58: Hoare triple {1883#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:15,715 INFO L280 TraceCheckUtils]: 59: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:15,718 INFO L280 TraceCheckUtils]: 60: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:15,719 INFO L280 TraceCheckUtils]: 61: Hoare triple {1884#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:15,720 INFO L280 TraceCheckUtils]: 62: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:15,721 INFO L263 TraceCheckUtils]: 63: Hoare triple {1881#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1885#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:15,721 INFO L280 TraceCheckUtils]: 64: Hoare triple {1885#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1886#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:15,721 INFO L280 TraceCheckUtils]: 65: Hoare triple {1886#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1851#false} is VALID [2020-07-18 05:00:15,722 INFO L280 TraceCheckUtils]: 66: Hoare triple {1851#false} assume !false; {1851#false} is VALID [2020-07-18 05:00:15,728 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-18 05:00:15,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [699547458] [2020-07-18 05:00:15,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:00:15,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-18 05:00:15,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752098118] [2020-07-18 05:00:15,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-18 05:00:15,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:15,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 05:00:15,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:15,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 05:00:15,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 05:00:15,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-18 05:00:15,791 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-07-18 05:00:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:21,141 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-07-18 05:00:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-18 05:00:21,141 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-18 05:00:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:00:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 05:00:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2020-07-18 05:00:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 05:00:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2020-07-18 05:00:21,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 191 transitions. [2020-07-18 05:00:21,478 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:21,484 INFO L225 Difference]: With dead ends: 179 [2020-07-18 05:00:21,484 INFO L226 Difference]: Without dead ends: 177 [2020-07-18 05:00:21,485 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-18 05:00:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-07-18 05:00:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-07-18 05:00:21,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:00:21,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 151 states. [2020-07-18 05:00:21,873 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 151 states. [2020-07-18 05:00:21,873 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 151 states. [2020-07-18 05:00:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:21,882 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-07-18 05:00:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-07-18 05:00:21,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:21,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:21,884 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 177 states. [2020-07-18 05:00:21,884 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 177 states. [2020-07-18 05:00:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:21,892 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2020-07-18 05:00:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2020-07-18 05:00:21,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:21,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:21,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:00:21,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:00:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-18 05:00:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-07-18 05:00:21,902 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-07-18 05:00:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:00:21,905 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-07-18 05:00:21,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 05:00:21,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 151 states and 164 transitions. [2020-07-18 05:00:22,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-07-18 05:00:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 05:00:22,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:22,176 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:22,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 05:00:22,177 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:22,177 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-07-18 05:00:22,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:22,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705844788] [2020-07-18 05:00:22,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:22,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2937#true} is VALID [2020-07-18 05:00:22,471 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-18 05:00:22,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-18 05:00:22,471 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,471 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2937#true} {2937#true} #117#return; {2937#true} is VALID [2020-07-18 05:00:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:22,477 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 05:00:22,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 05:00:22,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-18 05:00:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:22,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 05:00:22,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 05:00:22,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,492 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2937#true} #101#return; {2937#true} is VALID [2020-07-18 05:00:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:22,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {2975#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2937#true} is VALID [2020-07-18 05:00:22,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,514 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-18 05:00:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:22,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 05:00:22,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 05:00:22,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,531 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:22,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 05:00:22,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 05:00:22,542 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,543 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,544 INFO L263 TraceCheckUtils]: 0: Hoare triple {2937#true} call ULTIMATE.init(); {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:22,545 INFO L280 TraceCheckUtils]: 1: Hoare triple {2974#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2937#true} is VALID [2020-07-18 05:00:22,545 INFO L280 TraceCheckUtils]: 2: Hoare triple {2937#true} #valid := #valid[0 := 0]; {2937#true} is VALID [2020-07-18 05:00:22,545 INFO L280 TraceCheckUtils]: 3: Hoare triple {2937#true} assume 0 < #StackHeapBarrier; {2937#true} is VALID [2020-07-18 05:00:22,545 INFO L280 TraceCheckUtils]: 4: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,545 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2937#true} {2937#true} #117#return; {2937#true} is VALID [2020-07-18 05:00:22,546 INFO L263 TraceCheckUtils]: 6: Hoare triple {2937#true} call #t~ret14 := main(); {2937#true} is VALID [2020-07-18 05:00:22,546 INFO L280 TraceCheckUtils]: 7: Hoare triple {2937#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2937#true} is VALID [2020-07-18 05:00:22,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {2937#true} ~n~0 := #t~nondet8; {2937#true} is VALID [2020-07-18 05:00:22,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {2937#true} havoc #t~nondet8; {2937#true} is VALID [2020-07-18 05:00:22,548 INFO L263 TraceCheckUtils]: 10: Hoare triple {2937#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {2937#true} is VALID [2020-07-18 05:00:22,548 INFO L280 TraceCheckUtils]: 11: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 05:00:22,548 INFO L280 TraceCheckUtils]: 12: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 05:00:22,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,549 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2937#true} {2937#true} #99#return; {2937#true} is VALID [2020-07-18 05:00:22,549 INFO L280 TraceCheckUtils]: 15: Hoare triple {2937#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2937#true} is VALID [2020-07-18 05:00:22,549 INFO L280 TraceCheckUtils]: 16: Hoare triple {2937#true} ~i~0 := #t~nondet9; {2937#true} is VALID [2020-07-18 05:00:22,550 INFO L280 TraceCheckUtils]: 17: Hoare triple {2937#true} havoc #t~nondet9; {2937#true} is VALID [2020-07-18 05:00:22,550 INFO L263 TraceCheckUtils]: 18: Hoare triple {2937#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {2937#true} is VALID [2020-07-18 05:00:22,550 INFO L280 TraceCheckUtils]: 19: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 05:00:22,550 INFO L280 TraceCheckUtils]: 20: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 05:00:22,550 INFO L280 TraceCheckUtils]: 21: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,551 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2937#true} {2937#true} #101#return; {2937#true} is VALID [2020-07-18 05:00:22,551 INFO L280 TraceCheckUtils]: 23: Hoare triple {2937#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {2937#true} is VALID [2020-07-18 05:00:22,553 INFO L263 TraceCheckUtils]: 24: Hoare triple {2937#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {2975#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:22,553 INFO L280 TraceCheckUtils]: 25: Hoare triple {2975#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2937#true} is VALID [2020-07-18 05:00:22,554 INFO L280 TraceCheckUtils]: 26: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,554 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2937#true} {2937#true} #103#return; {2937#true} is VALID [2020-07-18 05:00:22,554 INFO L280 TraceCheckUtils]: 28: Hoare triple {2937#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {2937#true} is VALID [2020-07-18 05:00:22,556 INFO L263 TraceCheckUtils]: 29: Hoare triple {2937#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {2955#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 05:00:22,557 INFO L280 TraceCheckUtils]: 30: Hoare triple {2955#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {2956#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:22,557 INFO L280 TraceCheckUtils]: 31: Hoare triple {2956#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:22,558 INFO L280 TraceCheckUtils]: 32: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:22,559 INFO L280 TraceCheckUtils]: 33: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:22,559 INFO L280 TraceCheckUtils]: 34: Hoare triple {2957#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,560 INFO L280 TraceCheckUtils]: 35: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,560 INFO L263 TraceCheckUtils]: 36: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {2937#true} is VALID [2020-07-18 05:00:22,561 INFO L280 TraceCheckUtils]: 37: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 05:00:22,561 INFO L280 TraceCheckUtils]: 38: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 05:00:22,561 INFO L280 TraceCheckUtils]: 39: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,562 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,562 INFO L263 TraceCheckUtils]: 41: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {2937#true} is VALID [2020-07-18 05:00:22,562 INFO L280 TraceCheckUtils]: 42: Hoare triple {2937#true} ~cond := #in~cond; {2937#true} is VALID [2020-07-18 05:00:22,563 INFO L280 TraceCheckUtils]: 43: Hoare triple {2937#true} assume !(0 == ~cond); {2937#true} is VALID [2020-07-18 05:00:22,563 INFO L280 TraceCheckUtils]: 44: Hoare triple {2937#true} assume true; {2937#true} is VALID [2020-07-18 05:00:22,564 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2937#true} {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,564 INFO L280 TraceCheckUtils]: 46: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,565 INFO L280 TraceCheckUtils]: 47: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,566 INFO L280 TraceCheckUtils]: 48: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,567 INFO L280 TraceCheckUtils]: 49: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,567 INFO L280 TraceCheckUtils]: 50: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(#t~mem1 <= #t~mem2); {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,568 INFO L280 TraceCheckUtils]: 51: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,569 INFO L280 TraceCheckUtils]: 52: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:22,570 INFO L280 TraceCheckUtils]: 53: Hoare triple {2958#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post4 := ~y; {2967#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-18 05:00:22,571 INFO L280 TraceCheckUtils]: 54: Hoare triple {2967#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:22,571 INFO L280 TraceCheckUtils]: 55: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:22,573 INFO L263 TraceCheckUtils]: 56: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {2969#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:22,573 INFO L280 TraceCheckUtils]: 57: Hoare triple {2969#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {2970#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:22,575 INFO L280 TraceCheckUtils]: 58: Hoare triple {2970#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:22,576 INFO L280 TraceCheckUtils]: 59: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:22,577 INFO L280 TraceCheckUtils]: 60: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:22,577 INFO L280 TraceCheckUtils]: 61: Hoare triple {2971#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:22,578 INFO L280 TraceCheckUtils]: 62: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:22,579 INFO L263 TraceCheckUtils]: 63: Hoare triple {2968#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {2972#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:22,580 INFO L280 TraceCheckUtils]: 64: Hoare triple {2972#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2973#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:22,580 INFO L280 TraceCheckUtils]: 65: Hoare triple {2973#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2938#false} is VALID [2020-07-18 05:00:22,581 INFO L280 TraceCheckUtils]: 66: Hoare triple {2938#false} assume !false; {2938#false} is VALID [2020-07-18 05:00:22,588 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-18 05:00:22,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705844788] [2020-07-18 05:00:22,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 05:00:22,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 05:00:22,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032525811] [2020-07-18 05:00:22,589 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-18 05:00:22,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:22,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 05:00:22,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:22,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 05:00:22,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 05:00:22,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-18 05:00:22,660 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-07-18 05:00:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:27,315 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-07-18 05:00:27,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-18 05:00:27,316 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-07-18 05:00:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:00:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 05:00:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 193 transitions. [2020-07-18 05:00:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 05:00:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 193 transitions. [2020-07-18 05:00:27,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 193 transitions. [2020-07-18 05:00:27,646 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:27,652 INFO L225 Difference]: With dead ends: 221 [2020-07-18 05:00:27,652 INFO L226 Difference]: Without dead ends: 219 [2020-07-18 05:00:27,653 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-18 05:00:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-07-18 05:00:28,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-07-18 05:00:28,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:00:28,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand 194 states. [2020-07-18 05:00:28,216 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand 194 states. [2020-07-18 05:00:28,216 INFO L87 Difference]: Start difference. First operand 219 states. Second operand 194 states. [2020-07-18 05:00:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:28,226 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2020-07-18 05:00:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2020-07-18 05:00:28,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:28,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:28,229 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 219 states. [2020-07-18 05:00:28,229 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 219 states. [2020-07-18 05:00:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:28,240 INFO L93 Difference]: Finished difference Result 219 states and 240 transitions. [2020-07-18 05:00:28,240 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2020-07-18 05:00:28,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:28,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:28,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:00:28,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:00:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-18 05:00:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-07-18 05:00:28,254 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-07-18 05:00:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:00:28,255 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-07-18 05:00:28,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 05:00:28,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 194 states and 212 transitions. [2020-07-18 05:00:28,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-07-18 05:00:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-18 05:00:28,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:28,616 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:28,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 05:00:28,617 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-07-18 05:00:28,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:28,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1006358233] [2020-07-18 05:00:28,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:28,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4283#true} is VALID [2020-07-18 05:00:28,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} #valid := #valid[0 := 0]; {4283#true} is VALID [2020-07-18 05:00:28,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume 0 < #StackHeapBarrier; {4283#true} is VALID [2020-07-18 05:00:28,872 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:28,873 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4283#true} {4283#true} #117#return; {4283#true} is VALID [2020-07-18 05:00:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:28,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 05:00:28,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 05:00:28,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:28,879 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4283#true} #99#return; {4283#true} is VALID [2020-07-18 05:00:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:28,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 05:00:28,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 05:00:28,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:28,895 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4283#true} #101#return; {4283#true} is VALID [2020-07-18 05:00:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:28,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {4329#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:00:28,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:00:28,954 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {4283#true} #103#return; {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 05:00:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:28,972 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 05:00:28,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 05:00:28,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:28,974 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:28,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 05:00:28,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 05:00:28,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:28,997 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:29,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {4283#true} ~x := #in~x; {4283#true} is VALID [2020-07-18 05:00:29,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {4283#true} ~y := #in~y; {4283#true} is VALID [2020-07-18 05:00:29,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4283#true} is VALID [2020-07-18 05:00:29,004 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} ~i := #in~i; {4283#true} is VALID [2020-07-18 05:00:29,004 INFO L280 TraceCheckUtils]: 4: Hoare triple {4283#true} ~n := #in~n; {4283#true} is VALID [2020-07-18 05:00:29,005 INFO L280 TraceCheckUtils]: 5: Hoare triple {4283#true} assume ~x >= ~y; {4283#true} is VALID [2020-07-18 05:00:29,005 INFO L280 TraceCheckUtils]: 6: Hoare triple {4283#true} #res := ~x; {4283#true} is VALID [2020-07-18 05:00:29,005 INFO L280 TraceCheckUtils]: 7: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:29,006 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #113#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,007 INFO L263 TraceCheckUtils]: 0: Hoare triple {4283#true} call ULTIMATE.init(); {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:29,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {4328#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4283#true} is VALID [2020-07-18 05:00:29,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {4283#true} #valid := #valid[0 := 0]; {4283#true} is VALID [2020-07-18 05:00:29,008 INFO L280 TraceCheckUtils]: 3: Hoare triple {4283#true} assume 0 < #StackHeapBarrier; {4283#true} is VALID [2020-07-18 05:00:29,010 INFO L280 TraceCheckUtils]: 4: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:29,010 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4283#true} {4283#true} #117#return; {4283#true} is VALID [2020-07-18 05:00:29,010 INFO L263 TraceCheckUtils]: 6: Hoare triple {4283#true} call #t~ret14 := main(); {4283#true} is VALID [2020-07-18 05:00:29,010 INFO L280 TraceCheckUtils]: 7: Hoare triple {4283#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4283#true} is VALID [2020-07-18 05:00:29,011 INFO L280 TraceCheckUtils]: 8: Hoare triple {4283#true} ~n~0 := #t~nondet8; {4283#true} is VALID [2020-07-18 05:00:29,011 INFO L280 TraceCheckUtils]: 9: Hoare triple {4283#true} havoc #t~nondet8; {4283#true} is VALID [2020-07-18 05:00:29,011 INFO L263 TraceCheckUtils]: 10: Hoare triple {4283#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {4283#true} is VALID [2020-07-18 05:00:29,011 INFO L280 TraceCheckUtils]: 11: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 05:00:29,012 INFO L280 TraceCheckUtils]: 12: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 05:00:29,012 INFO L280 TraceCheckUtils]: 13: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:29,012 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {4283#true} {4283#true} #99#return; {4283#true} is VALID [2020-07-18 05:00:29,012 INFO L280 TraceCheckUtils]: 15: Hoare triple {4283#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {4283#true} is VALID [2020-07-18 05:00:29,013 INFO L280 TraceCheckUtils]: 16: Hoare triple {4283#true} ~i~0 := #t~nondet9; {4283#true} is VALID [2020-07-18 05:00:29,013 INFO L280 TraceCheckUtils]: 17: Hoare triple {4283#true} havoc #t~nondet9; {4283#true} is VALID [2020-07-18 05:00:29,013 INFO L263 TraceCheckUtils]: 18: Hoare triple {4283#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {4283#true} is VALID [2020-07-18 05:00:29,013 INFO L280 TraceCheckUtils]: 19: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 05:00:29,014 INFO L280 TraceCheckUtils]: 20: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 05:00:29,014 INFO L280 TraceCheckUtils]: 21: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:29,014 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {4283#true} {4283#true} #101#return; {4283#true} is VALID [2020-07-18 05:00:29,014 INFO L280 TraceCheckUtils]: 23: Hoare triple {4283#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {4283#true} is VALID [2020-07-18 05:00:29,016 INFO L263 TraceCheckUtils]: 24: Hoare triple {4283#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {4329#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:29,017 INFO L280 TraceCheckUtils]: 25: Hoare triple {4329#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:00:29,018 INFO L280 TraceCheckUtils]: 26: Hoare triple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:00:29,020 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {4330#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {4283#true} #103#return; {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 05:00:29,021 INFO L280 TraceCheckUtils]: 28: Hoare triple {4301#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {4302#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 05:00:29,023 INFO L263 TraceCheckUtils]: 29: Hoare triple {4302#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:00:29,023 INFO L280 TraceCheckUtils]: 30: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:00:29,024 INFO L280 TraceCheckUtils]: 31: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:00:29,026 INFO L280 TraceCheckUtils]: 32: Hoare triple {4303#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,027 INFO L280 TraceCheckUtils]: 33: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,031 INFO L280 TraceCheckUtils]: 34: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,038 INFO L280 TraceCheckUtils]: 35: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,038 INFO L263 TraceCheckUtils]: 36: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {4283#true} is VALID [2020-07-18 05:00:29,039 INFO L280 TraceCheckUtils]: 37: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 05:00:29,039 INFO L280 TraceCheckUtils]: 38: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 05:00:29,039 INFO L280 TraceCheckUtils]: 39: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:29,048 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,049 INFO L263 TraceCheckUtils]: 41: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {4283#true} is VALID [2020-07-18 05:00:29,049 INFO L280 TraceCheckUtils]: 42: Hoare triple {4283#true} ~cond := #in~cond; {4283#true} is VALID [2020-07-18 05:00:29,049 INFO L280 TraceCheckUtils]: 43: Hoare triple {4283#true} assume !(0 == ~cond); {4283#true} is VALID [2020-07-18 05:00:29,050 INFO L280 TraceCheckUtils]: 44: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:29,052 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,052 INFO L280 TraceCheckUtils]: 46: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,053 INFO L280 TraceCheckUtils]: 47: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,053 INFO L280 TraceCheckUtils]: 48: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,054 INFO L280 TraceCheckUtils]: 49: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,055 INFO L280 TraceCheckUtils]: 50: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,055 INFO L280 TraceCheckUtils]: 51: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem1; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,056 INFO L280 TraceCheckUtils]: 52: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem2; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,057 INFO L280 TraceCheckUtils]: 53: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #t~post3 := ~x; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,058 INFO L280 TraceCheckUtils]: 54: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x := 1 + #t~post3; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,058 INFO L280 TraceCheckUtils]: 55: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~post3; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,059 INFO L263 TraceCheckUtils]: 56: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {4283#true} is VALID [2020-07-18 05:00:29,059 INFO L280 TraceCheckUtils]: 57: Hoare triple {4283#true} ~x := #in~x; {4283#true} is VALID [2020-07-18 05:00:29,059 INFO L280 TraceCheckUtils]: 58: Hoare triple {4283#true} ~y := #in~y; {4283#true} is VALID [2020-07-18 05:00:29,059 INFO L280 TraceCheckUtils]: 59: Hoare triple {4283#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {4283#true} is VALID [2020-07-18 05:00:29,060 INFO L280 TraceCheckUtils]: 60: Hoare triple {4283#true} ~i := #in~i; {4283#true} is VALID [2020-07-18 05:00:29,060 INFO L280 TraceCheckUtils]: 61: Hoare triple {4283#true} ~n := #in~n; {4283#true} is VALID [2020-07-18 05:00:29,060 INFO L280 TraceCheckUtils]: 62: Hoare triple {4283#true} assume ~x >= ~y; {4283#true} is VALID [2020-07-18 05:00:29,060 INFO L280 TraceCheckUtils]: 63: Hoare triple {4283#true} #res := ~x; {4283#true} is VALID [2020-07-18 05:00:29,061 INFO L280 TraceCheckUtils]: 64: Hoare triple {4283#true} assume true; {4283#true} is VALID [2020-07-18 05:00:29,062 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {4283#true} {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #113#return; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,063 INFO L280 TraceCheckUtils]: 66: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,063 INFO L280 TraceCheckUtils]: 67: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x1~0 := #t~ret5; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,064 INFO L280 TraceCheckUtils]: 68: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~ret5; {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:00:29,065 INFO L280 TraceCheckUtils]: 69: Hoare triple {4304#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem6 := read~int(~a.base, ~a.offset + 4 * ~i, 4); srcloc: L31 {4322#(and (= 0 |check_#t~mem6|) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-18 05:00:29,066 INFO L280 TraceCheckUtils]: 70: Hoare triple {4322#(and (= 0 |check_#t~mem6|) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} ~ai~0 := #t~mem6; {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-18 05:00:29,067 INFO L280 TraceCheckUtils]: 71: Hoare triple {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} havoc #t~mem6; {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-18 05:00:29,067 INFO L280 TraceCheckUtils]: 72: Hoare triple {4323#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} SUMMARY for call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4); srcloc: L32 {4324#(and (= 0 check_~ai~0) (= 0 |check_#t~mem7|))} is VALID [2020-07-18 05:00:29,068 INFO L280 TraceCheckUtils]: 73: Hoare triple {4324#(and (= 0 check_~ai~0) (= 0 |check_#t~mem7|))} ~ax~0 := #t~mem7; {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-18 05:00:29,069 INFO L280 TraceCheckUtils]: 74: Hoare triple {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} havoc #t~mem7; {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-18 05:00:29,070 INFO L263 TraceCheckUtils]: 75: Hoare triple {4325#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {4326#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:29,071 INFO L280 TraceCheckUtils]: 76: Hoare triple {4326#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4327#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:29,071 INFO L280 TraceCheckUtils]: 77: Hoare triple {4327#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4284#false} is VALID [2020-07-18 05:00:29,072 INFO L280 TraceCheckUtils]: 78: Hoare triple {4284#false} assume !false; {4284#false} is VALID [2020-07-18 05:00:29,080 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-18 05:00:29,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1006358233] [2020-07-18 05:00:29,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:00:29,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-18 05:00:29,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985626493] [2020-07-18 05:00:29,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-18 05:00:29,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:29,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 05:00:29,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:29,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 05:00:29,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:29,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 05:00:29,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-18 05:00:29,161 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-07-18 05:00:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:33,610 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-18 05:00:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 05:00:33,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-07-18 05:00:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:00:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 05:00:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2020-07-18 05:00:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 05:00:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 82 transitions. [2020-07-18 05:00:33,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 82 transitions. [2020-07-18 05:00:33,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:33,768 INFO L225 Difference]: With dead ends: 206 [2020-07-18 05:00:33,768 INFO L226 Difference]: Without dead ends: 142 [2020-07-18 05:00:33,770 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-07-18 05:00:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-07-18 05:00:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-07-18 05:00:34,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:00:34,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 113 states. [2020-07-18 05:00:34,139 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 113 states. [2020-07-18 05:00:34,139 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 113 states. [2020-07-18 05:00:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:34,144 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-18 05:00:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-18 05:00:34,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:34,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:34,146 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 142 states. [2020-07-18 05:00:34,146 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 142 states. [2020-07-18 05:00:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:34,152 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2020-07-18 05:00:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2020-07-18 05:00:34,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:34,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:34,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:00:34,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:00:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-18 05:00:34,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-07-18 05:00:34,157 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-07-18 05:00:34,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:00:34,158 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-07-18 05:00:34,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 05:00:34,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 120 transitions. [2020-07-18 05:00:34,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-07-18 05:00:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-18 05:00:34,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:34,414 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:34,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 05:00:34,415 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:34,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-07-18 05:00:34,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:34,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [58879776] [2020-07-18 05:00:34,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5287#true} is VALID [2020-07-18 05:00:34,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} #valid := #valid[0 := 0]; {5287#true} is VALID [2020-07-18 05:00:34,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume 0 < #StackHeapBarrier; {5287#true} is VALID [2020-07-18 05:00:34,907 INFO L280 TraceCheckUtils]: 3: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,908 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5287#true} {5287#true} #117#return; {5287#true} is VALID [2020-07-18 05:00:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,912 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #99#return; {5287#true} is VALID [2020-07-18 05:00:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,915 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #101#return; {5287#true} is VALID [2020-07-18 05:00:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {5338#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5287#true} is VALID [2020-07-18 05:00:34,937 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,937 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #103#return; {5287#true} is VALID [2020-07-18 05:00:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,946 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,947 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,959 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,959 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,960 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,965 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,966 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:34,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,974 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:34,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {5287#true} call ULTIMATE.init(); {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:34,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {5337#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5287#true} is VALID [2020-07-18 05:00:34,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {5287#true} #valid := #valid[0 := 0]; {5287#true} is VALID [2020-07-18 05:00:34,976 INFO L280 TraceCheckUtils]: 3: Hoare triple {5287#true} assume 0 < #StackHeapBarrier; {5287#true} is VALID [2020-07-18 05:00:34,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,976 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5287#true} {5287#true} #117#return; {5287#true} is VALID [2020-07-18 05:00:34,976 INFO L263 TraceCheckUtils]: 6: Hoare triple {5287#true} call #t~ret14 := main(); {5287#true} is VALID [2020-07-18 05:00:34,977 INFO L280 TraceCheckUtils]: 7: Hoare triple {5287#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5287#true} is VALID [2020-07-18 05:00:34,977 INFO L280 TraceCheckUtils]: 8: Hoare triple {5287#true} ~n~0 := #t~nondet8; {5287#true} is VALID [2020-07-18 05:00:34,977 INFO L280 TraceCheckUtils]: 9: Hoare triple {5287#true} havoc #t~nondet8; {5287#true} is VALID [2020-07-18 05:00:34,977 INFO L263 TraceCheckUtils]: 10: Hoare triple {5287#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {5287#true} is VALID [2020-07-18 05:00:34,977 INFO L280 TraceCheckUtils]: 11: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,977 INFO L280 TraceCheckUtils]: 12: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,978 INFO L280 TraceCheckUtils]: 13: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,978 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {5287#true} {5287#true} #99#return; {5287#true} is VALID [2020-07-18 05:00:34,978 INFO L280 TraceCheckUtils]: 15: Hoare triple {5287#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {5287#true} is VALID [2020-07-18 05:00:34,978 INFO L280 TraceCheckUtils]: 16: Hoare triple {5287#true} ~i~0 := #t~nondet9; {5287#true} is VALID [2020-07-18 05:00:34,978 INFO L280 TraceCheckUtils]: 17: Hoare triple {5287#true} havoc #t~nondet9; {5287#true} is VALID [2020-07-18 05:00:34,979 INFO L263 TraceCheckUtils]: 18: Hoare triple {5287#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {5287#true} is VALID [2020-07-18 05:00:34,979 INFO L280 TraceCheckUtils]: 19: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,979 INFO L280 TraceCheckUtils]: 20: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,979 INFO L280 TraceCheckUtils]: 21: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,979 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {5287#true} {5287#true} #101#return; {5287#true} is VALID [2020-07-18 05:00:34,979 INFO L280 TraceCheckUtils]: 23: Hoare triple {5287#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {5287#true} is VALID [2020-07-18 05:00:34,981 INFO L263 TraceCheckUtils]: 24: Hoare triple {5287#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {5338#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:34,981 INFO L280 TraceCheckUtils]: 25: Hoare triple {5338#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5287#true} is VALID [2020-07-18 05:00:34,981 INFO L280 TraceCheckUtils]: 26: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,981 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {5287#true} {5287#true} #103#return; {5287#true} is VALID [2020-07-18 05:00:34,981 INFO L280 TraceCheckUtils]: 28: Hoare triple {5287#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {5287#true} is VALID [2020-07-18 05:00:34,982 INFO L263 TraceCheckUtils]: 29: Hoare triple {5287#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {5305#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 05:00:34,983 INFO L280 TraceCheckUtils]: 30: Hoare triple {5305#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {5306#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:34,984 INFO L280 TraceCheckUtils]: 31: Hoare triple {5306#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:34,985 INFO L280 TraceCheckUtils]: 32: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:34,985 INFO L280 TraceCheckUtils]: 33: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:34,986 INFO L280 TraceCheckUtils]: 34: Hoare triple {5307#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,987 INFO L280 TraceCheckUtils]: 35: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,987 INFO L263 TraceCheckUtils]: 36: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5287#true} is VALID [2020-07-18 05:00:34,987 INFO L280 TraceCheckUtils]: 37: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,987 INFO L280 TraceCheckUtils]: 38: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,987 INFO L280 TraceCheckUtils]: 39: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,988 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,988 INFO L263 TraceCheckUtils]: 41: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {5287#true} is VALID [2020-07-18 05:00:34,989 INFO L280 TraceCheckUtils]: 42: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:34,989 INFO L280 TraceCheckUtils]: 43: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:34,989 INFO L280 TraceCheckUtils]: 44: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:34,990 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {5287#true} {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,990 INFO L280 TraceCheckUtils]: 46: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,991 INFO L280 TraceCheckUtils]: 47: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,992 INFO L280 TraceCheckUtils]: 48: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,992 INFO L280 TraceCheckUtils]: 49: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,993 INFO L280 TraceCheckUtils]: 50: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,994 INFO L280 TraceCheckUtils]: 51: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,995 INFO L280 TraceCheckUtils]: 52: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,996 INFO L280 TraceCheckUtils]: 53: Hoare triple {5308#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {5317#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:34,997 INFO L280 TraceCheckUtils]: 54: Hoare triple {5317#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:34,998 INFO L280 TraceCheckUtils]: 55: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,005 INFO L263 TraceCheckUtils]: 56: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {5319#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:35,006 INFO L280 TraceCheckUtils]: 57: Hoare triple {5319#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {5320#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:35,007 INFO L280 TraceCheckUtils]: 58: Hoare triple {5320#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,008 INFO L280 TraceCheckUtils]: 59: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,008 INFO L280 TraceCheckUtils]: 60: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,009 INFO L280 TraceCheckUtils]: 61: Hoare triple {5321#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,009 INFO L280 TraceCheckUtils]: 62: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,009 INFO L263 TraceCheckUtils]: 63: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5287#true} is VALID [2020-07-18 05:00:35,010 INFO L280 TraceCheckUtils]: 64: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:35,010 INFO L280 TraceCheckUtils]: 65: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:35,010 INFO L280 TraceCheckUtils]: 66: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:35,010 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,010 INFO L263 TraceCheckUtils]: 68: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {5287#true} is VALID [2020-07-18 05:00:35,011 INFO L280 TraceCheckUtils]: 69: Hoare triple {5287#true} ~cond := #in~cond; {5287#true} is VALID [2020-07-18 05:00:35,011 INFO L280 TraceCheckUtils]: 70: Hoare triple {5287#true} assume !(0 == ~cond); {5287#true} is VALID [2020-07-18 05:00:35,011 INFO L280 TraceCheckUtils]: 71: Hoare triple {5287#true} assume true; {5287#true} is VALID [2020-07-18 05:00:35,011 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {5287#true} {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,012 INFO L280 TraceCheckUtils]: 73: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,012 INFO L280 TraceCheckUtils]: 74: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,013 INFO L280 TraceCheckUtils]: 75: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,014 INFO L280 TraceCheckUtils]: 76: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,015 INFO L280 TraceCheckUtils]: 77: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume #t~mem1 <= #t~mem2; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,015 INFO L280 TraceCheckUtils]: 78: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,016 INFO L280 TraceCheckUtils]: 79: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:35,016 INFO L280 TraceCheckUtils]: 80: Hoare triple {5318#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post3 := ~x; {5330#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:35,017 INFO L280 TraceCheckUtils]: 81: Hoare triple {5330#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:35,018 INFO L280 TraceCheckUtils]: 82: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~post3; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:35,019 INFO L263 TraceCheckUtils]: 83: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {5332#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:35,020 INFO L280 TraceCheckUtils]: 84: Hoare triple {5332#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {5333#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:35,020 INFO L280 TraceCheckUtils]: 85: Hoare triple {5333#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:35,021 INFO L280 TraceCheckUtils]: 86: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:35,021 INFO L280 TraceCheckUtils]: 87: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:35,022 INFO L280 TraceCheckUtils]: 88: Hoare triple {5334#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:35,023 INFO L280 TraceCheckUtils]: 89: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:35,024 INFO L263 TraceCheckUtils]: 90: Hoare triple {5331#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {5335#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:35,024 INFO L280 TraceCheckUtils]: 91: Hoare triple {5335#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {5336#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:35,025 INFO L280 TraceCheckUtils]: 92: Hoare triple {5336#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {5288#false} is VALID [2020-07-18 05:00:35,025 INFO L280 TraceCheckUtils]: 93: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2020-07-18 05:00:35,035 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-18 05:00:35,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [58879776] [2020-07-18 05:00:35,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:00:35,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-18 05:00:35,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709767848] [2020-07-18 05:00:35,037 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 05:00:35,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:35,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 05:00:35,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:35,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 05:00:35,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 05:00:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-18 05:00:35,143 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-07-18 05:00:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:40,347 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-07-18 05:00:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-18 05:00:40,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 05:00:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:00:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 05:00:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2020-07-18 05:00:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 05:00:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 148 transitions. [2020-07-18 05:00:40,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 148 transitions. [2020-07-18 05:00:40,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:40,620 INFO L225 Difference]: With dead ends: 168 [2020-07-18 05:00:40,621 INFO L226 Difference]: Without dead ends: 166 [2020-07-18 05:00:40,622 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-18 05:00:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-18 05:00:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-07-18 05:00:40,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:00:40,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 119 states. [2020-07-18 05:00:40,984 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 119 states. [2020-07-18 05:00:40,984 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 119 states. [2020-07-18 05:00:40,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:40,990 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2020-07-18 05:00:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2020-07-18 05:00:40,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:40,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:40,991 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 166 states. [2020-07-18 05:00:40,991 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 166 states. [2020-07-18 05:00:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:40,997 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2020-07-18 05:00:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2020-07-18 05:00:40,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:40,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:40,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:00:40,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:00:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-18 05:00:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-07-18 05:00:41,003 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-07-18 05:00:41,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:00:41,003 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-07-18 05:00:41,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 05:00:41,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 128 transitions. [2020-07-18 05:00:41,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-07-18 05:00:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-18 05:00:41,266 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:41,267 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:41,268 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 05:00:41,268 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-07-18 05:00:41,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:41,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2128053130] [2020-07-18 05:00:41,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6294#true} is VALID [2020-07-18 05:00:41,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} #valid := #valid[0 := 0]; {6294#true} is VALID [2020-07-18 05:00:41,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume 0 < #StackHeapBarrier; {6294#true} is VALID [2020-07-18 05:00:41,732 INFO L280 TraceCheckUtils]: 3: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,732 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6294#true} {6294#true} #117#return; {6294#true} is VALID [2020-07-18 05:00:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,748 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6294#true} #99#return; {6294#true} is VALID [2020-07-18 05:00:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,753 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,754 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6294#true} #101#return; {6294#true} is VALID [2020-07-18 05:00:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {6345#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6294#true} is VALID [2020-07-18 05:00:41,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,780 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6294#true} {6294#true} #103#return; {6294#true} is VALID [2020-07-18 05:00:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,792 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,793 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,802 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,810 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,811 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:41,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,819 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,820 INFO L263 TraceCheckUtils]: 0: Hoare triple {6294#true} call ULTIMATE.init(); {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:41,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {6344#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6294#true} is VALID [2020-07-18 05:00:41,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {6294#true} #valid := #valid[0 := 0]; {6294#true} is VALID [2020-07-18 05:00:41,821 INFO L280 TraceCheckUtils]: 3: Hoare triple {6294#true} assume 0 < #StackHeapBarrier; {6294#true} is VALID [2020-07-18 05:00:41,821 INFO L280 TraceCheckUtils]: 4: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,821 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6294#true} {6294#true} #117#return; {6294#true} is VALID [2020-07-18 05:00:41,821 INFO L263 TraceCheckUtils]: 6: Hoare triple {6294#true} call #t~ret14 := main(); {6294#true} is VALID [2020-07-18 05:00:41,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {6294#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6294#true} is VALID [2020-07-18 05:00:41,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {6294#true} ~n~0 := #t~nondet8; {6294#true} is VALID [2020-07-18 05:00:41,822 INFO L280 TraceCheckUtils]: 9: Hoare triple {6294#true} havoc #t~nondet8; {6294#true} is VALID [2020-07-18 05:00:41,822 INFO L263 TraceCheckUtils]: 10: Hoare triple {6294#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {6294#true} is VALID [2020-07-18 05:00:41,823 INFO L280 TraceCheckUtils]: 11: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,823 INFO L280 TraceCheckUtils]: 12: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,823 INFO L280 TraceCheckUtils]: 13: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,823 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {6294#true} {6294#true} #99#return; {6294#true} is VALID [2020-07-18 05:00:41,824 INFO L280 TraceCheckUtils]: 15: Hoare triple {6294#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {6294#true} is VALID [2020-07-18 05:00:41,824 INFO L280 TraceCheckUtils]: 16: Hoare triple {6294#true} ~i~0 := #t~nondet9; {6294#true} is VALID [2020-07-18 05:00:41,824 INFO L280 TraceCheckUtils]: 17: Hoare triple {6294#true} havoc #t~nondet9; {6294#true} is VALID [2020-07-18 05:00:41,824 INFO L263 TraceCheckUtils]: 18: Hoare triple {6294#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {6294#true} is VALID [2020-07-18 05:00:41,824 INFO L280 TraceCheckUtils]: 19: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,825 INFO L280 TraceCheckUtils]: 20: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,825 INFO L280 TraceCheckUtils]: 21: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,825 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {6294#true} {6294#true} #101#return; {6294#true} is VALID [2020-07-18 05:00:41,825 INFO L280 TraceCheckUtils]: 23: Hoare triple {6294#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {6294#true} is VALID [2020-07-18 05:00:41,827 INFO L263 TraceCheckUtils]: 24: Hoare triple {6294#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {6345#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:41,827 INFO L280 TraceCheckUtils]: 25: Hoare triple {6345#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6294#true} is VALID [2020-07-18 05:00:41,828 INFO L280 TraceCheckUtils]: 26: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,828 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {6294#true} {6294#true} #103#return; {6294#true} is VALID [2020-07-18 05:00:41,828 INFO L280 TraceCheckUtils]: 28: Hoare triple {6294#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {6294#true} is VALID [2020-07-18 05:00:41,830 INFO L263 TraceCheckUtils]: 29: Hoare triple {6294#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {6312#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 05:00:41,830 INFO L280 TraceCheckUtils]: 30: Hoare triple {6312#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {6313#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:41,831 INFO L280 TraceCheckUtils]: 31: Hoare triple {6313#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:41,832 INFO L280 TraceCheckUtils]: 32: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:41,833 INFO L280 TraceCheckUtils]: 33: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:41,834 INFO L280 TraceCheckUtils]: 34: Hoare triple {6314#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,834 INFO L280 TraceCheckUtils]: 35: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,834 INFO L263 TraceCheckUtils]: 36: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6294#true} is VALID [2020-07-18 05:00:41,835 INFO L280 TraceCheckUtils]: 37: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,835 INFO L280 TraceCheckUtils]: 38: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,835 INFO L280 TraceCheckUtils]: 39: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,836 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,836 INFO L263 TraceCheckUtils]: 41: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {6294#true} is VALID [2020-07-18 05:00:41,836 INFO L280 TraceCheckUtils]: 42: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,837 INFO L280 TraceCheckUtils]: 43: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,837 INFO L280 TraceCheckUtils]: 44: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,838 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {6294#true} {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,838 INFO L280 TraceCheckUtils]: 46: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,839 INFO L280 TraceCheckUtils]: 47: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,840 INFO L280 TraceCheckUtils]: 48: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,841 INFO L280 TraceCheckUtils]: 49: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,841 INFO L280 TraceCheckUtils]: 50: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,842 INFO L280 TraceCheckUtils]: 51: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,843 INFO L280 TraceCheckUtils]: 52: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,843 INFO L280 TraceCheckUtils]: 53: Hoare triple {6315#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {6324#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:41,844 INFO L280 TraceCheckUtils]: 54: Hoare triple {6324#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,845 INFO L280 TraceCheckUtils]: 55: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,846 INFO L263 TraceCheckUtils]: 56: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {6326#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:41,847 INFO L280 TraceCheckUtils]: 57: Hoare triple {6326#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {6327#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:41,847 INFO L280 TraceCheckUtils]: 58: Hoare triple {6327#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,848 INFO L280 TraceCheckUtils]: 59: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,849 INFO L280 TraceCheckUtils]: 60: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,849 INFO L280 TraceCheckUtils]: 61: Hoare triple {6328#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,850 INFO L280 TraceCheckUtils]: 62: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,850 INFO L263 TraceCheckUtils]: 63: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6294#true} is VALID [2020-07-18 05:00:41,850 INFO L280 TraceCheckUtils]: 64: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,850 INFO L280 TraceCheckUtils]: 65: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,851 INFO L280 TraceCheckUtils]: 66: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,851 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,852 INFO L263 TraceCheckUtils]: 68: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {6294#true} is VALID [2020-07-18 05:00:41,852 INFO L280 TraceCheckUtils]: 69: Hoare triple {6294#true} ~cond := #in~cond; {6294#true} is VALID [2020-07-18 05:00:41,852 INFO L280 TraceCheckUtils]: 70: Hoare triple {6294#true} assume !(0 == ~cond); {6294#true} is VALID [2020-07-18 05:00:41,852 INFO L280 TraceCheckUtils]: 71: Hoare triple {6294#true} assume true; {6294#true} is VALID [2020-07-18 05:00:41,853 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {6294#true} {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,854 INFO L280 TraceCheckUtils]: 73: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,854 INFO L280 TraceCheckUtils]: 74: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,855 INFO L280 TraceCheckUtils]: 75: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,856 INFO L280 TraceCheckUtils]: 76: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,857 INFO L280 TraceCheckUtils]: 77: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(#t~mem1 <= #t~mem2); {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,857 INFO L280 TraceCheckUtils]: 78: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,858 INFO L280 TraceCheckUtils]: 79: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:41,858 INFO L280 TraceCheckUtils]: 80: Hoare triple {6325#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post4 := ~y; {6337#(and (<= 1 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-18 05:00:41,859 INFO L280 TraceCheckUtils]: 81: Hoare triple {6337#(and (<= 1 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:41,860 INFO L280 TraceCheckUtils]: 82: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:41,861 INFO L263 TraceCheckUtils]: 83: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {6339#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:41,862 INFO L280 TraceCheckUtils]: 84: Hoare triple {6339#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {6340#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:41,863 INFO L280 TraceCheckUtils]: 85: Hoare triple {6340#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:41,863 INFO L280 TraceCheckUtils]: 86: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:41,865 INFO L280 TraceCheckUtils]: 87: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:41,865 INFO L280 TraceCheckUtils]: 88: Hoare triple {6341#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:41,867 INFO L280 TraceCheckUtils]: 89: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:41,868 INFO L263 TraceCheckUtils]: 90: Hoare triple {6338#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {6342#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:41,868 INFO L280 TraceCheckUtils]: 91: Hoare triple {6342#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {6343#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:41,869 INFO L280 TraceCheckUtils]: 92: Hoare triple {6343#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {6295#false} is VALID [2020-07-18 05:00:41,869 INFO L280 TraceCheckUtils]: 93: Hoare triple {6295#false} assume !false; {6295#false} is VALID [2020-07-18 05:00:41,883 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-18 05:00:41,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2128053130] [2020-07-18 05:00:41,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:00:41,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-18 05:00:41,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492177877] [2020-07-18 05:00:41,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 05:00:41,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:41,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 05:00:41,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:41,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 05:00:41,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:41,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 05:00:41,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-18 05:00:41,986 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-07-18 05:00:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:48,305 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-07-18 05:00:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-18 05:00:48,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 05:00:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:00:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 05:00:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-18 05:00:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 05:00:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-18 05:00:48,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 148 transitions. [2020-07-18 05:00:48,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:48,577 INFO L225 Difference]: With dead ends: 191 [2020-07-18 05:00:48,577 INFO L226 Difference]: Without dead ends: 189 [2020-07-18 05:00:48,579 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-18 05:00:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-18 05:00:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-07-18 05:00:49,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:00:49,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 142 states. [2020-07-18 05:00:49,213 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 142 states. [2020-07-18 05:00:49,213 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 142 states. [2020-07-18 05:00:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:49,220 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2020-07-18 05:00:49,221 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2020-07-18 05:00:49,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:49,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:49,222 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 189 states. [2020-07-18 05:00:49,222 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 189 states. [2020-07-18 05:00:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:49,228 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2020-07-18 05:00:49,228 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2020-07-18 05:00:49,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:49,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:49,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:00:49,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:00:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-18 05:00:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-07-18 05:00:49,238 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-07-18 05:00:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:00:49,239 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-07-18 05:00:49,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 05:00:49,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 142 states and 153 transitions. [2020-07-18 05:00:49,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-07-18 05:00:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-18 05:00:49,582 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:49,583 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:49,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 05:00:49,583 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:49,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-07-18 05:00:49,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:49,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [793914228] [2020-07-18 05:00:49,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7443#true} is VALID [2020-07-18 05:00:50,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} #valid := #valid[0 := 0]; {7443#true} is VALID [2020-07-18 05:00:50,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume 0 < #StackHeapBarrier; {7443#true} is VALID [2020-07-18 05:00:50,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,035 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7443#true} {7443#true} #117#return; {7443#true} is VALID [2020-07-18 05:00:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,044 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,044 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,044 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #99#return; {7443#true} is VALID [2020-07-18 05:00:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,048 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7443#true} #101#return; {7443#true} is VALID [2020-07-18 05:00:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {7494#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7443#true} is VALID [2020-07-18 05:00:50,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,081 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7443#true} {7443#true} #103#return; {7443#true} is VALID [2020-07-18 05:00:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,088 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,089 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,090 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,095 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,100 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,100 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,101 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #109#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:50,108 INFO L280 TraceCheckUtils]: 0: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,109 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #111#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,110 INFO L263 TraceCheckUtils]: 0: Hoare triple {7443#true} call ULTIMATE.init(); {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:50,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {7493#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7443#true} is VALID [2020-07-18 05:00:50,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {7443#true} #valid := #valid[0 := 0]; {7443#true} is VALID [2020-07-18 05:00:50,111 INFO L280 TraceCheckUtils]: 3: Hoare triple {7443#true} assume 0 < #StackHeapBarrier; {7443#true} is VALID [2020-07-18 05:00:50,111 INFO L280 TraceCheckUtils]: 4: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,111 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7443#true} {7443#true} #117#return; {7443#true} is VALID [2020-07-18 05:00:50,111 INFO L263 TraceCheckUtils]: 6: Hoare triple {7443#true} call #t~ret14 := main(); {7443#true} is VALID [2020-07-18 05:00:50,111 INFO L280 TraceCheckUtils]: 7: Hoare triple {7443#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {7443#true} is VALID [2020-07-18 05:00:50,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {7443#true} ~n~0 := #t~nondet8; {7443#true} is VALID [2020-07-18 05:00:50,112 INFO L280 TraceCheckUtils]: 9: Hoare triple {7443#true} havoc #t~nondet8; {7443#true} is VALID [2020-07-18 05:00:50,112 INFO L263 TraceCheckUtils]: 10: Hoare triple {7443#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {7443#true} is VALID [2020-07-18 05:00:50,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,112 INFO L280 TraceCheckUtils]: 13: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,113 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7443#true} {7443#true} #99#return; {7443#true} is VALID [2020-07-18 05:00:50,113 INFO L280 TraceCheckUtils]: 15: Hoare triple {7443#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {7443#true} is VALID [2020-07-18 05:00:50,113 INFO L280 TraceCheckUtils]: 16: Hoare triple {7443#true} ~i~0 := #t~nondet9; {7443#true} is VALID [2020-07-18 05:00:50,113 INFO L280 TraceCheckUtils]: 17: Hoare triple {7443#true} havoc #t~nondet9; {7443#true} is VALID [2020-07-18 05:00:50,113 INFO L263 TraceCheckUtils]: 18: Hoare triple {7443#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {7443#true} is VALID [2020-07-18 05:00:50,113 INFO L280 TraceCheckUtils]: 19: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,114 INFO L280 TraceCheckUtils]: 20: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,114 INFO L280 TraceCheckUtils]: 21: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,114 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {7443#true} {7443#true} #101#return; {7443#true} is VALID [2020-07-18 05:00:50,114 INFO L280 TraceCheckUtils]: 23: Hoare triple {7443#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {7443#true} is VALID [2020-07-18 05:00:50,117 INFO L263 TraceCheckUtils]: 24: Hoare triple {7443#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {7494#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:50,118 INFO L280 TraceCheckUtils]: 25: Hoare triple {7494#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7443#true} is VALID [2020-07-18 05:00:50,118 INFO L280 TraceCheckUtils]: 26: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,118 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7443#true} {7443#true} #103#return; {7443#true} is VALID [2020-07-18 05:00:50,118 INFO L280 TraceCheckUtils]: 28: Hoare triple {7443#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {7443#true} is VALID [2020-07-18 05:00:50,119 INFO L263 TraceCheckUtils]: 29: Hoare triple {7443#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {7461#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 05:00:50,120 INFO L280 TraceCheckUtils]: 30: Hoare triple {7461#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {7462#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:50,121 INFO L280 TraceCheckUtils]: 31: Hoare triple {7462#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:50,121 INFO L280 TraceCheckUtils]: 32: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:50,122 INFO L280 TraceCheckUtils]: 33: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:50,123 INFO L280 TraceCheckUtils]: 34: Hoare triple {7463#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,123 INFO L280 TraceCheckUtils]: 35: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,124 INFO L263 TraceCheckUtils]: 36: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7443#true} is VALID [2020-07-18 05:00:50,124 INFO L280 TraceCheckUtils]: 37: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,124 INFO L280 TraceCheckUtils]: 38: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,124 INFO L280 TraceCheckUtils]: 39: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,125 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,125 INFO L263 TraceCheckUtils]: 41: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {7443#true} is VALID [2020-07-18 05:00:50,125 INFO L280 TraceCheckUtils]: 42: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,125 INFO L280 TraceCheckUtils]: 43: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,126 INFO L280 TraceCheckUtils]: 44: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,126 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {7443#true} {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,127 INFO L280 TraceCheckUtils]: 46: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,128 INFO L280 TraceCheckUtils]: 47: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,128 INFO L280 TraceCheckUtils]: 48: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,129 INFO L280 TraceCheckUtils]: 49: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,130 INFO L280 TraceCheckUtils]: 50: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(#t~mem1 <= #t~mem2); {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,130 INFO L280 TraceCheckUtils]: 51: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,131 INFO L280 TraceCheckUtils]: 52: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:50,132 INFO L280 TraceCheckUtils]: 53: Hoare triple {7464#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post4 := ~y; {7473#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} is VALID [2020-07-18 05:00:50,133 INFO L280 TraceCheckUtils]: 54: Hoare triple {7473#(and (= 0 check_~x) (<= (+ |check_#t~post4| 1) check_~n))} ~y := #t~post4 - 1; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,133 INFO L280 TraceCheckUtils]: 55: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post4; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,135 INFO L263 TraceCheckUtils]: 56: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {7475#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,135 INFO L280 TraceCheckUtils]: 57: Hoare triple {7475#(and (= 0 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {7476#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,136 INFO L280 TraceCheckUtils]: 58: Hoare triple {7476#(and (= 0 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,137 INFO L280 TraceCheckUtils]: 59: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,137 INFO L280 TraceCheckUtils]: 60: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,138 INFO L280 TraceCheckUtils]: 61: Hoare triple {7477#(and (= 0 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,139 INFO L280 TraceCheckUtils]: 62: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,139 INFO L263 TraceCheckUtils]: 63: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7443#true} is VALID [2020-07-18 05:00:50,139 INFO L280 TraceCheckUtils]: 64: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,139 INFO L280 TraceCheckUtils]: 65: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,139 INFO L280 TraceCheckUtils]: 66: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,140 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #109#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,140 INFO L263 TraceCheckUtils]: 68: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {7443#true} is VALID [2020-07-18 05:00:50,140 INFO L280 TraceCheckUtils]: 69: Hoare triple {7443#true} ~cond := #in~cond; {7443#true} is VALID [2020-07-18 05:00:50,141 INFO L280 TraceCheckUtils]: 70: Hoare triple {7443#true} assume !(0 == ~cond); {7443#true} is VALID [2020-07-18 05:00:50,141 INFO L280 TraceCheckUtils]: 71: Hoare triple {7443#true} assume true; {7443#true} is VALID [2020-07-18 05:00:50,144 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {7443#true} {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #111#return; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,144 INFO L280 TraceCheckUtils]: 73: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} ~x0~0 := ~x; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,145 INFO L280 TraceCheckUtils]: 74: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} ~y0~0 := ~y; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,146 INFO L280 TraceCheckUtils]: 75: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,146 INFO L280 TraceCheckUtils]: 76: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,147 INFO L280 TraceCheckUtils]: 77: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} assume #t~mem1 <= #t~mem2; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,148 INFO L280 TraceCheckUtils]: 78: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~mem1; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,148 INFO L280 TraceCheckUtils]: 79: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~mem2; {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,149 INFO L280 TraceCheckUtils]: 80: Hoare triple {7474#(and (= 0 check_~x) (<= (+ check_~y 2) check_~n))} #t~post3 := ~x; {7486#(and (= 0 |check_#t~post3|) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,150 INFO L280 TraceCheckUtils]: 81: Hoare triple {7486#(and (= 0 |check_#t~post3|) (<= (+ check_~y 2) check_~n))} ~x := 1 + #t~post3; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,150 INFO L280 TraceCheckUtils]: 82: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} havoc #t~post3; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,152 INFO L263 TraceCheckUtils]: 83: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {7488#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,152 INFO L280 TraceCheckUtils]: 84: Hoare triple {7488#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {7489#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,153 INFO L280 TraceCheckUtils]: 85: Hoare triple {7489#(and (<= 1 check_~x) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~y := #in~y; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,154 INFO L280 TraceCheckUtils]: 86: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,154 INFO L280 TraceCheckUtils]: 87: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~i := #in~i; {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} is VALID [2020-07-18 05:00:50,155 INFO L280 TraceCheckUtils]: 88: Hoare triple {7490#(and (<= 1 check_~x) (<= (+ check_~y 2) |check_#in~n|))} ~n := #in~n; {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,156 INFO L280 TraceCheckUtils]: 89: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} assume !(~x >= ~y); {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} is VALID [2020-07-18 05:00:50,157 INFO L263 TraceCheckUtils]: 90: Hoare triple {7487#(and (<= 1 check_~x) (<= (+ check_~y 2) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {7491#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:50,157 INFO L280 TraceCheckUtils]: 91: Hoare triple {7491#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {7492#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:50,158 INFO L280 TraceCheckUtils]: 92: Hoare triple {7492#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {7444#false} is VALID [2020-07-18 05:00:50,158 INFO L280 TraceCheckUtils]: 93: Hoare triple {7444#false} assume !false; {7444#false} is VALID [2020-07-18 05:00:50,172 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-18 05:00:50,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [793914228] [2020-07-18 05:00:50,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:00:50,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-18 05:00:50,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001633060] [2020-07-18 05:00:50,174 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 05:00:50,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:50,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-18 05:00:50,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:50,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-18 05:00:50,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:50,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-18 05:00:50,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-18 05:00:50,269 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-07-18 05:00:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:56,073 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-07-18 05:00:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-18 05:00:56,074 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-07-18 05:00:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:00:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 05:00:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-18 05:00:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 05:00:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2020-07-18 05:00:56,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 148 transitions. [2020-07-18 05:00:56,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:56,327 INFO L225 Difference]: With dead ends: 208 [2020-07-18 05:00:56,327 INFO L226 Difference]: Without dead ends: 206 [2020-07-18 05:00:56,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-07-18 05:00:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-18 05:00:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-07-18 05:00:57,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:00:57,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 182 states. [2020-07-18 05:00:57,008 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 182 states. [2020-07-18 05:00:57,008 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 182 states. [2020-07-18 05:00:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:57,015 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2020-07-18 05:00:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2020-07-18 05:00:57,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:57,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:57,016 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 206 states. [2020-07-18 05:00:57,016 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 206 states. [2020-07-18 05:00:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:00:57,022 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2020-07-18 05:00:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2020-07-18 05:00:57,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:00:57,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:00:57,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:00:57,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:00:57,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-18 05:00:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-07-18 05:00:57,028 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-07-18 05:00:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:00:57,028 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-07-18 05:00:57,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-18 05:00:57,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 182 states and 195 transitions. [2020-07-18 05:00:57,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-07-18 05:00:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-18 05:00:57,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:00:57,510 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:00:57,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 05:00:57,510 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:00:57,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:00:57,511 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-07-18 05:00:57,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:00:57,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921263695] [2020-07-18 05:00:57,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:00:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8741#true} is VALID [2020-07-18 05:00:58,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} #valid := #valid[0 := 0]; {8741#true} is VALID [2020-07-18 05:00:58,196 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume 0 < #StackHeapBarrier; {8741#true} is VALID [2020-07-18 05:00:58,196 INFO L280 TraceCheckUtils]: 3: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,196 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8741#true} {8741#true} #117#return; {8741#true} is VALID [2020-07-18 05:00:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,207 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,208 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8741#true} #99#return; {8741#true} is VALID [2020-07-18 05:00:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,212 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8741#true} #101#return; {8741#true} is VALID [2020-07-18 05:00:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {8805#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8741#true} is VALID [2020-07-18 05:00:58,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,243 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8741#true} {8741#true} #103#return; {8741#true} is VALID [2020-07-18 05:00:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,249 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,252 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,261 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,265 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,266 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,267 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,273 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,278 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #109#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:00:58,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,283 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,284 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #111#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,285 INFO L263 TraceCheckUtils]: 0: Hoare triple {8741#true} call ULTIMATE.init(); {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:00:58,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {8804#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8741#true} is VALID [2020-07-18 05:00:58,285 INFO L280 TraceCheckUtils]: 2: Hoare triple {8741#true} #valid := #valid[0 := 0]; {8741#true} is VALID [2020-07-18 05:00:58,286 INFO L280 TraceCheckUtils]: 3: Hoare triple {8741#true} assume 0 < #StackHeapBarrier; {8741#true} is VALID [2020-07-18 05:00:58,286 INFO L280 TraceCheckUtils]: 4: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,286 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8741#true} {8741#true} #117#return; {8741#true} is VALID [2020-07-18 05:00:58,286 INFO L263 TraceCheckUtils]: 6: Hoare triple {8741#true} call #t~ret14 := main(); {8741#true} is VALID [2020-07-18 05:00:58,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {8741#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8741#true} is VALID [2020-07-18 05:00:58,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {8741#true} ~n~0 := #t~nondet8; {8741#true} is VALID [2020-07-18 05:00:58,287 INFO L280 TraceCheckUtils]: 9: Hoare triple {8741#true} havoc #t~nondet8; {8741#true} is VALID [2020-07-18 05:00:58,287 INFO L263 TraceCheckUtils]: 10: Hoare triple {8741#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {8741#true} is VALID [2020-07-18 05:00:58,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,287 INFO L280 TraceCheckUtils]: 12: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,287 INFO L280 TraceCheckUtils]: 13: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,288 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {8741#true} {8741#true} #99#return; {8741#true} is VALID [2020-07-18 05:00:58,288 INFO L280 TraceCheckUtils]: 15: Hoare triple {8741#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {8741#true} is VALID [2020-07-18 05:00:58,288 INFO L280 TraceCheckUtils]: 16: Hoare triple {8741#true} ~i~0 := #t~nondet9; {8741#true} is VALID [2020-07-18 05:00:58,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {8741#true} havoc #t~nondet9; {8741#true} is VALID [2020-07-18 05:00:58,288 INFO L263 TraceCheckUtils]: 18: Hoare triple {8741#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {8741#true} is VALID [2020-07-18 05:00:58,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,289 INFO L280 TraceCheckUtils]: 21: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,289 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {8741#true} {8741#true} #101#return; {8741#true} is VALID [2020-07-18 05:00:58,289 INFO L280 TraceCheckUtils]: 23: Hoare triple {8741#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {8741#true} is VALID [2020-07-18 05:00:58,291 INFO L263 TraceCheckUtils]: 24: Hoare triple {8741#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {8805#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:00:58,291 INFO L280 TraceCheckUtils]: 25: Hoare triple {8805#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8741#true} is VALID [2020-07-18 05:00:58,291 INFO L280 TraceCheckUtils]: 26: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,291 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {8741#true} {8741#true} #103#return; {8741#true} is VALID [2020-07-18 05:00:58,291 INFO L280 TraceCheckUtils]: 28: Hoare triple {8741#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {8741#true} is VALID [2020-07-18 05:00:58,293 INFO L263 TraceCheckUtils]: 29: Hoare triple {8741#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {8759#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-18 05:00:58,294 INFO L280 TraceCheckUtils]: 30: Hoare triple {8759#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {8760#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:58,294 INFO L280 TraceCheckUtils]: 31: Hoare triple {8760#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:58,295 INFO L280 TraceCheckUtils]: 32: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:58,296 INFO L280 TraceCheckUtils]: 33: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~i := #in~i; {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-18 05:00:58,297 INFO L280 TraceCheckUtils]: 34: Hoare triple {8761#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,297 INFO L280 TraceCheckUtils]: 35: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,298 INFO L263 TraceCheckUtils]: 36: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 05:00:58,298 INFO L280 TraceCheckUtils]: 37: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,298 INFO L280 TraceCheckUtils]: 38: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,298 INFO L280 TraceCheckUtils]: 39: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,299 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #109#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,299 INFO L263 TraceCheckUtils]: 41: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 05:00:58,299 INFO L280 TraceCheckUtils]: 42: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,299 INFO L280 TraceCheckUtils]: 43: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,300 INFO L280 TraceCheckUtils]: 44: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,300 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {8741#true} {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #111#return; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,301 INFO L280 TraceCheckUtils]: 46: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,302 INFO L280 TraceCheckUtils]: 47: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,303 INFO L280 TraceCheckUtils]: 48: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,304 INFO L280 TraceCheckUtils]: 49: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,304 INFO L280 TraceCheckUtils]: 50: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,305 INFO L280 TraceCheckUtils]: 51: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,306 INFO L280 TraceCheckUtils]: 52: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,306 INFO L280 TraceCheckUtils]: 53: Hoare triple {8762#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {8771#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,307 INFO L280 TraceCheckUtils]: 54: Hoare triple {8771#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,308 INFO L280 TraceCheckUtils]: 55: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,309 INFO L263 TraceCheckUtils]: 56: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8773#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:58,310 INFO L280 TraceCheckUtils]: 57: Hoare triple {8773#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {8774#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:58,311 INFO L280 TraceCheckUtils]: 58: Hoare triple {8774#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,312 INFO L280 TraceCheckUtils]: 59: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,312 INFO L280 TraceCheckUtils]: 60: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~i := #in~i; {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,313 INFO L280 TraceCheckUtils]: 61: Hoare triple {8775#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,314 INFO L280 TraceCheckUtils]: 62: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,314 INFO L263 TraceCheckUtils]: 63: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 05:00:58,314 INFO L280 TraceCheckUtils]: 64: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,315 INFO L280 TraceCheckUtils]: 65: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,315 INFO L280 TraceCheckUtils]: 66: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,316 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #109#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,316 INFO L263 TraceCheckUtils]: 68: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 05:00:58,316 INFO L280 TraceCheckUtils]: 69: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,316 INFO L280 TraceCheckUtils]: 70: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,316 INFO L280 TraceCheckUtils]: 71: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,317 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {8741#true} {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #111#return; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,318 INFO L280 TraceCheckUtils]: 73: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,319 INFO L280 TraceCheckUtils]: 74: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,319 INFO L280 TraceCheckUtils]: 75: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,320 INFO L280 TraceCheckUtils]: 76: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,321 INFO L280 TraceCheckUtils]: 77: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume #t~mem1 <= #t~mem2; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,321 INFO L280 TraceCheckUtils]: 78: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,322 INFO L280 TraceCheckUtils]: 79: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-18 05:00:58,323 INFO L280 TraceCheckUtils]: 80: Hoare triple {8772#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post3 := ~x; {8784#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-18 05:00:58,324 INFO L280 TraceCheckUtils]: 81: Hoare triple {8784#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,325 INFO L280 TraceCheckUtils]: 82: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~post3; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,326 INFO L263 TraceCheckUtils]: 83: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8786#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-18 05:00:58,327 INFO L280 TraceCheckUtils]: 84: Hoare triple {8786#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {8787#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,327 INFO L280 TraceCheckUtils]: 85: Hoare triple {8787#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,328 INFO L280 TraceCheckUtils]: 86: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,329 INFO L280 TraceCheckUtils]: 87: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,329 INFO L280 TraceCheckUtils]: 88: Hoare triple {8788#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,330 INFO L280 TraceCheckUtils]: 89: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,330 INFO L263 TraceCheckUtils]: 90: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 05:00:58,330 INFO L280 TraceCheckUtils]: 91: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,331 INFO L280 TraceCheckUtils]: 92: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,331 INFO L280 TraceCheckUtils]: 93: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,332 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #109#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,332 INFO L263 TraceCheckUtils]: 95: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {8741#true} is VALID [2020-07-18 05:00:58,332 INFO L280 TraceCheckUtils]: 96: Hoare triple {8741#true} ~cond := #in~cond; {8741#true} is VALID [2020-07-18 05:00:58,332 INFO L280 TraceCheckUtils]: 97: Hoare triple {8741#true} assume !(0 == ~cond); {8741#true} is VALID [2020-07-18 05:00:58,332 INFO L280 TraceCheckUtils]: 98: Hoare triple {8741#true} assume true; {8741#true} is VALID [2020-07-18 05:00:58,333 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {8741#true} {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #111#return; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,334 INFO L280 TraceCheckUtils]: 100: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} ~x0~0 := ~x; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,334 INFO L280 TraceCheckUtils]: 101: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} ~y0~0 := ~y; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,335 INFO L280 TraceCheckUtils]: 102: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,336 INFO L280 TraceCheckUtils]: 103: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,336 INFO L280 TraceCheckUtils]: 104: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(#t~mem1 <= #t~mem2); {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,337 INFO L280 TraceCheckUtils]: 105: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~mem1; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,338 INFO L280 TraceCheckUtils]: 106: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~mem2; {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,338 INFO L280 TraceCheckUtils]: 107: Hoare triple {8785#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} #t~post4 := ~y; {8797#(and (<= (+ |check_#t~post4| 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,339 INFO L280 TraceCheckUtils]: 108: Hoare triple {8797#(and (<= (+ |check_#t~post4| 1) check_~n) (<= 2 check_~x))} ~y := #t~post4 - 1; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,340 INFO L280 TraceCheckUtils]: 109: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} havoc #t~post4; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,342 INFO L263 TraceCheckUtils]: 110: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {8799#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} is VALID [2020-07-18 05:00:58,343 INFO L280 TraceCheckUtils]: 111: Hoare triple {8799#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 2) |check_#in~n|))} ~x := #in~x; {8800#(and (<= (+ |check_#in~y| 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,343 INFO L280 TraceCheckUtils]: 112: Hoare triple {8800#(and (<= (+ |check_#in~y| 2) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,344 INFO L280 TraceCheckUtils]: 113: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,345 INFO L280 TraceCheckUtils]: 114: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~i := #in~i; {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,346 INFO L280 TraceCheckUtils]: 115: Hoare triple {8801#(and (<= (+ check_~y 2) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,346 INFO L280 TraceCheckUtils]: 116: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} is VALID [2020-07-18 05:00:58,347 INFO L263 TraceCheckUtils]: 117: Hoare triple {8798#(and (<= (+ check_~y 2) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {8802#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 05:00:58,348 INFO L280 TraceCheckUtils]: 118: Hoare triple {8802#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {8803#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 05:00:58,349 INFO L280 TraceCheckUtils]: 119: Hoare triple {8803#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {8742#false} is VALID [2020-07-18 05:00:58,349 INFO L280 TraceCheckUtils]: 120: Hoare triple {8742#false} assume !false; {8742#false} is VALID [2020-07-18 05:00:58,372 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-18 05:00:58,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921263695] [2020-07-18 05:00:58,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:00:58,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-07-18 05:00:58,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381367879] [2020-07-18 05:00:58,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-18 05:00:58,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:00:58,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2020-07-18 05:00:58,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:00:58,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-18 05:00:58,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:00:58,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-18 05:00:58,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-07-18 05:00:58,505 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-07-18 05:01:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:01:07,044 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-07-18 05:01:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-18 05:01:07,044 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-07-18 05:01:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:01:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 05:01:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 176 transitions. [2020-07-18 05:01:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 05:01:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 176 transitions. [2020-07-18 05:01:07,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 176 transitions. [2020-07-18 05:01:07,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:01:07,456 INFO L225 Difference]: With dead ends: 237 [2020-07-18 05:01:07,456 INFO L226 Difference]: Without dead ends: 171 [2020-07-18 05:01:07,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-07-18 05:01:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-18 05:01:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-07-18 05:01:08,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:01:08,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 159 states. [2020-07-18 05:01:08,089 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 159 states. [2020-07-18 05:01:08,089 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 159 states. [2020-07-18 05:01:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:01:08,093 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2020-07-18 05:01:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2020-07-18 05:01:08,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:01:08,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:01:08,094 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 171 states. [2020-07-18 05:01:08,095 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 171 states. [2020-07-18 05:01:08,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:01:08,100 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2020-07-18 05:01:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2020-07-18 05:01:08,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:01:08,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:01:08,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:01:08,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:01:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-18 05:01:08,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-18 05:01:08,105 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-07-18 05:01:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:01:08,106 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-18 05:01:08,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-18 05:01:08,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 169 transitions. [2020-07-18 05:01:08,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 05:01:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-18 05:01:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-07-18 05:01:08,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 05:01:08,577 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 05:01:08,577 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 05:01:08,578 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 05:01:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 05:01:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-07-18 05:01:08,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 05:01:08,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1741415375] [2020-07-18 05:01:08,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 05:01:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10011#true} is VALID [2020-07-18 05:01:08,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} #valid := #valid[0 := 0]; {10011#true} is VALID [2020-07-18 05:01:08,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume 0 < #StackHeapBarrier; {10011#true} is VALID [2020-07-18 05:01:08,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,733 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10011#true} {10011#true} #117#return; {10011#true} is VALID [2020-07-18 05:01:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,737 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10011#true} #99#return; {10011#true} is VALID [2020-07-18 05:01:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,741 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,741 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10011#true} #101#return; {10011#true} is VALID [2020-07-18 05:01:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,775 INFO L280 TraceCheckUtils]: 0: Hoare triple {10060#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:01:08,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:01:08,778 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {10011#true} #103#return; {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 05:01:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,787 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,793 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,797 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,797 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,797 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,798 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,803 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,804 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,808 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10012#false} #109#return; {10012#false} is VALID [2020-07-18 05:01:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 05:01:08,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,817 INFO L280 TraceCheckUtils]: 1: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,818 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10011#true} {10012#false} #111#return; {10012#false} is VALID [2020-07-18 05:01:08,819 INFO L263 TraceCheckUtils]: 0: Hoare triple {10011#true} call ULTIMATE.init(); {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 05:01:08,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {10059#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10011#true} is VALID [2020-07-18 05:01:08,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {10011#true} #valid := #valid[0 := 0]; {10011#true} is VALID [2020-07-18 05:01:08,819 INFO L280 TraceCheckUtils]: 3: Hoare triple {10011#true} assume 0 < #StackHeapBarrier; {10011#true} is VALID [2020-07-18 05:01:08,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,820 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10011#true} {10011#true} #117#return; {10011#true} is VALID [2020-07-18 05:01:08,820 INFO L263 TraceCheckUtils]: 6: Hoare triple {10011#true} call #t~ret14 := main(); {10011#true} is VALID [2020-07-18 05:01:08,820 INFO L280 TraceCheckUtils]: 7: Hoare triple {10011#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10011#true} is VALID [2020-07-18 05:01:08,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {10011#true} ~n~0 := #t~nondet8; {10011#true} is VALID [2020-07-18 05:01:08,820 INFO L280 TraceCheckUtils]: 9: Hoare triple {10011#true} havoc #t~nondet8; {10011#true} is VALID [2020-07-18 05:01:08,821 INFO L263 TraceCheckUtils]: 10: Hoare triple {10011#true} call assume_abort_if_not((if ~n~0 >= 0 then 1 else 0)); {10011#true} is VALID [2020-07-18 05:01:08,821 INFO L280 TraceCheckUtils]: 11: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,821 INFO L280 TraceCheckUtils]: 12: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,821 INFO L280 TraceCheckUtils]: 13: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,821 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {10011#true} {10011#true} #99#return; {10011#true} is VALID [2020-07-18 05:01:08,821 INFO L280 TraceCheckUtils]: 15: Hoare triple {10011#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {10011#true} is VALID [2020-07-18 05:01:08,822 INFO L280 TraceCheckUtils]: 16: Hoare triple {10011#true} ~i~0 := #t~nondet9; {10011#true} is VALID [2020-07-18 05:01:08,822 INFO L280 TraceCheckUtils]: 17: Hoare triple {10011#true} havoc #t~nondet9; {10011#true} is VALID [2020-07-18 05:01:08,822 INFO L263 TraceCheckUtils]: 18: Hoare triple {10011#true} call assume_abort_if_not((if (0 <= ~i~0 && ~i~0 < ~n~0) && ~n~0 < 1073741824 then 1 else 0)); {10011#true} is VALID [2020-07-18 05:01:08,822 INFO L280 TraceCheckUtils]: 19: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,822 INFO L280 TraceCheckUtils]: 20: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,823 INFO L280 TraceCheckUtils]: 21: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,823 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {10011#true} {10011#true} #101#return; {10011#true} is VALID [2020-07-18 05:01:08,823 INFO L280 TraceCheckUtils]: 23: Hoare triple {10011#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L43-1 {10011#true} is VALID [2020-07-18 05:01:08,824 INFO L263 TraceCheckUtils]: 24: Hoare triple {10011#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {10060#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-18 05:01:08,825 INFO L280 TraceCheckUtils]: 25: Hoare triple {10060#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:01:08,826 INFO L280 TraceCheckUtils]: 26: Hoare triple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-18 05:01:08,827 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {10061#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {10011#true} #103#return; {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-18 05:01:08,828 INFO L280 TraceCheckUtils]: 28: Hoare triple {10029#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {10030#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-18 05:01:08,830 INFO L263 TraceCheckUtils]: 29: Hoare triple {10030#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~i~0, ~n~0); {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:01:08,830 INFO L280 TraceCheckUtils]: 30: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:01:08,831 INFO L280 TraceCheckUtils]: 31: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:01:08,832 INFO L280 TraceCheckUtils]: 32: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,832 INFO L280 TraceCheckUtils]: 33: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,833 INFO L280 TraceCheckUtils]: 34: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,833 INFO L280 TraceCheckUtils]: 35: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,833 INFO L263 TraceCheckUtils]: 36: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 05:01:08,833 INFO L280 TraceCheckUtils]: 37: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,834 INFO L280 TraceCheckUtils]: 38: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,834 INFO L280 TraceCheckUtils]: 39: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,835 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,835 INFO L263 TraceCheckUtils]: 41: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 05:01:08,835 INFO L280 TraceCheckUtils]: 42: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,835 INFO L280 TraceCheckUtils]: 43: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,835 INFO L280 TraceCheckUtils]: 44: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,836 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,837 INFO L280 TraceCheckUtils]: 46: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,837 INFO L280 TraceCheckUtils]: 47: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,838 INFO L280 TraceCheckUtils]: 48: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,838 INFO L280 TraceCheckUtils]: 49: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,839 INFO L280 TraceCheckUtils]: 50: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,839 INFO L280 TraceCheckUtils]: 51: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem1; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,840 INFO L280 TraceCheckUtils]: 52: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem2; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,841 INFO L280 TraceCheckUtils]: 53: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #t~post3 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,842 INFO L280 TraceCheckUtils]: 54: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x := 1 + #t~post3; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,842 INFO L280 TraceCheckUtils]: 55: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~post3; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,843 INFO L263 TraceCheckUtils]: 56: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:01:08,844 INFO L280 TraceCheckUtils]: 57: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:01:08,845 INFO L280 TraceCheckUtils]: 58: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-18 05:01:08,845 INFO L280 TraceCheckUtils]: 59: Hoare triple {10031#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,846 INFO L280 TraceCheckUtils]: 60: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i := #in~i; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,847 INFO L280 TraceCheckUtils]: 61: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,848 INFO L280 TraceCheckUtils]: 62: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,848 INFO L263 TraceCheckUtils]: 63: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 05:01:08,848 INFO L280 TraceCheckUtils]: 64: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,848 INFO L280 TraceCheckUtils]: 65: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,849 INFO L280 TraceCheckUtils]: 66: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,850 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #109#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,850 INFO L263 TraceCheckUtils]: 68: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 05:01:08,850 INFO L280 TraceCheckUtils]: 69: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,850 INFO L280 TraceCheckUtils]: 70: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,850 INFO L280 TraceCheckUtils]: 71: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,851 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {10011#true} {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #111#return; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,852 INFO L280 TraceCheckUtils]: 73: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,852 INFO L280 TraceCheckUtils]: 74: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-18 05:01:08,853 INFO L280 TraceCheckUtils]: 75: Hoare triple {10032#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10049#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem1|))} is VALID [2020-07-18 05:01:08,854 INFO L280 TraceCheckUtils]: 76: Hoare triple {10049#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem1|))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10050#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} is VALID [2020-07-18 05:01:08,855 INFO L280 TraceCheckUtils]: 77: Hoare triple {10050#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} assume !(#t~mem1 <= #t~mem2); {10012#false} is VALID [2020-07-18 05:01:08,855 INFO L280 TraceCheckUtils]: 78: Hoare triple {10012#false} havoc #t~mem1; {10012#false} is VALID [2020-07-18 05:01:08,855 INFO L280 TraceCheckUtils]: 79: Hoare triple {10012#false} havoc #t~mem2; {10012#false} is VALID [2020-07-18 05:01:08,855 INFO L280 TraceCheckUtils]: 80: Hoare triple {10012#false} #t~post4 := ~y; {10012#false} is VALID [2020-07-18 05:01:08,855 INFO L280 TraceCheckUtils]: 81: Hoare triple {10012#false} ~y := #t~post4 - 1; {10012#false} is VALID [2020-07-18 05:01:08,856 INFO L280 TraceCheckUtils]: 82: Hoare triple {10012#false} havoc #t~post4; {10012#false} is VALID [2020-07-18 05:01:08,856 INFO L263 TraceCheckUtils]: 83: Hoare triple {10012#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10012#false} is VALID [2020-07-18 05:01:08,856 INFO L280 TraceCheckUtils]: 84: Hoare triple {10012#false} ~x := #in~x; {10012#false} is VALID [2020-07-18 05:01:08,856 INFO L280 TraceCheckUtils]: 85: Hoare triple {10012#false} ~y := #in~y; {10012#false} is VALID [2020-07-18 05:01:08,856 INFO L280 TraceCheckUtils]: 86: Hoare triple {10012#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10012#false} is VALID [2020-07-18 05:01:08,857 INFO L280 TraceCheckUtils]: 87: Hoare triple {10012#false} ~i := #in~i; {10012#false} is VALID [2020-07-18 05:01:08,857 INFO L280 TraceCheckUtils]: 88: Hoare triple {10012#false} ~n := #in~n; {10012#false} is VALID [2020-07-18 05:01:08,857 INFO L280 TraceCheckUtils]: 89: Hoare triple {10012#false} assume !(~x >= ~y); {10012#false} is VALID [2020-07-18 05:01:08,857 INFO L263 TraceCheckUtils]: 90: Hoare triple {10012#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 05:01:08,857 INFO L280 TraceCheckUtils]: 91: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,857 INFO L280 TraceCheckUtils]: 92: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,858 INFO L280 TraceCheckUtils]: 93: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,858 INFO L275 TraceCheckUtils]: 94: Hoare quadruple {10011#true} {10012#false} #109#return; {10012#false} is VALID [2020-07-18 05:01:08,858 INFO L263 TraceCheckUtils]: 95: Hoare triple {10012#false} call assume_abort_if_not((if 0 <= ~i && ~i < ~n then 1 else 0)); {10011#true} is VALID [2020-07-18 05:01:08,858 INFO L280 TraceCheckUtils]: 96: Hoare triple {10011#true} ~cond := #in~cond; {10011#true} is VALID [2020-07-18 05:01:08,858 INFO L280 TraceCheckUtils]: 97: Hoare triple {10011#true} assume !(0 == ~cond); {10011#true} is VALID [2020-07-18 05:01:08,859 INFO L280 TraceCheckUtils]: 98: Hoare triple {10011#true} assume true; {10011#true} is VALID [2020-07-18 05:01:08,859 INFO L275 TraceCheckUtils]: 99: Hoare quadruple {10011#true} {10012#false} #111#return; {10012#false} is VALID [2020-07-18 05:01:08,859 INFO L280 TraceCheckUtils]: 100: Hoare triple {10012#false} ~x0~0 := ~x; {10012#false} is VALID [2020-07-18 05:01:08,859 INFO L280 TraceCheckUtils]: 101: Hoare triple {10012#false} ~y0~0 := ~y; {10012#false} is VALID [2020-07-18 05:01:08,859 INFO L280 TraceCheckUtils]: 102: Hoare triple {10012#false} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L24 {10012#false} is VALID [2020-07-18 05:01:08,859 INFO L280 TraceCheckUtils]: 103: Hoare triple {10012#false} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L24-1 {10012#false} is VALID [2020-07-18 05:01:08,860 INFO L280 TraceCheckUtils]: 104: Hoare triple {10012#false} assume #t~mem1 <= #t~mem2; {10012#false} is VALID [2020-07-18 05:01:08,860 INFO L280 TraceCheckUtils]: 105: Hoare triple {10012#false} havoc #t~mem1; {10012#false} is VALID [2020-07-18 05:01:08,860 INFO L280 TraceCheckUtils]: 106: Hoare triple {10012#false} havoc #t~mem2; {10012#false} is VALID [2020-07-18 05:01:08,860 INFO L280 TraceCheckUtils]: 107: Hoare triple {10012#false} #t~post3 := ~x; {10012#false} is VALID [2020-07-18 05:01:08,860 INFO L280 TraceCheckUtils]: 108: Hoare triple {10012#false} ~x := 1 + #t~post3; {10012#false} is VALID [2020-07-18 05:01:08,861 INFO L280 TraceCheckUtils]: 109: Hoare triple {10012#false} havoc #t~post3; {10012#false} is VALID [2020-07-18 05:01:08,861 INFO L263 TraceCheckUtils]: 110: Hoare triple {10012#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~i, ~n); {10012#false} is VALID [2020-07-18 05:01:08,861 INFO L280 TraceCheckUtils]: 111: Hoare triple {10012#false} ~x := #in~x; {10012#false} is VALID [2020-07-18 05:01:08,861 INFO L280 TraceCheckUtils]: 112: Hoare triple {10012#false} ~y := #in~y; {10012#false} is VALID [2020-07-18 05:01:08,861 INFO L280 TraceCheckUtils]: 113: Hoare triple {10012#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {10012#false} is VALID [2020-07-18 05:01:08,862 INFO L280 TraceCheckUtils]: 114: Hoare triple {10012#false} ~i := #in~i; {10012#false} is VALID [2020-07-18 05:01:08,862 INFO L280 TraceCheckUtils]: 115: Hoare triple {10012#false} ~n := #in~n; {10012#false} is VALID [2020-07-18 05:01:08,862 INFO L280 TraceCheckUtils]: 116: Hoare triple {10012#false} assume !(~x >= ~y); {10012#false} is VALID [2020-07-18 05:01:08,862 INFO L263 TraceCheckUtils]: 117: Hoare triple {10012#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {10012#false} is VALID [2020-07-18 05:01:08,862 INFO L280 TraceCheckUtils]: 118: Hoare triple {10012#false} ~cond := #in~cond; {10012#false} is VALID [2020-07-18 05:01:08,862 INFO L280 TraceCheckUtils]: 119: Hoare triple {10012#false} assume 0 == ~cond; {10012#false} is VALID [2020-07-18 05:01:08,862 INFO L280 TraceCheckUtils]: 120: Hoare triple {10012#false} assume !false; {10012#false} is VALID [2020-07-18 05:01:08,878 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-18 05:01:08,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1741415375] [2020-07-18 05:01:08,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 05:01:08,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 05:01:08,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542192641] [2020-07-18 05:01:08,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-07-18 05:01:08,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 05:01:08,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 05:01:09,015 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-18 05:01:09,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 05:01:09,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 05:01:09,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 05:01:09,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-18 05:01:09,017 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 11 states. [2020-07-18 05:01:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:01:10,419 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-07-18 05:01:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 05:01:10,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-07-18 05:01:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 05:01:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 05:01:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2020-07-18 05:01:10,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 05:01:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2020-07-18 05:01:10,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2020-07-18 05:01:10,545 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-18 05:01:10,545 INFO L225 Difference]: With dead ends: 163 [2020-07-18 05:01:10,545 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 05:01:10,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-18 05:01:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 05:01:10,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 05:01:10,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 05:01:10,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 05:01:10,547 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:01:10,547 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:01:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:01:10,548 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:01:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:01:10,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:01:10,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:01:10,548 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 05:01:10,548 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 05:01:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 05:01:10,549 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 05:01:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:01:10,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:01:10,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 05:01:10,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 05:01:10,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 05:01:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 05:01:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 05:01:10,550 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-07-18 05:01:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 05:01:10,550 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 05:01:10,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 05:01:10,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 05:01:10,551 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-18 05:01:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 05:01:10,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 05:01:10,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 05:01:10,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 05:01:13,390 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-07-18 05:01:13,591 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-18 05:01:13,909 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2020-07-18 05:01:14,181 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-18 05:01:14,370 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-18 05:01:14,593 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2020-07-18 05:01:14,889 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-18 05:01:15,197 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-18 05:01:15,563 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-07-18 05:01:15,910 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-07-18 05:01:16,254 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-07-18 05:01:16,441 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-18 05:01:16,773 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2020-07-18 05:01:17,013 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2020-07-18 05:01:17,411 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-07-18 05:01:17,780 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-18 05:01:18,123 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-07-18 05:01:18,353 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-07-18 05:01:18,617 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-07-18 05:01:18,860 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-18 05:01:19,215 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-18 05:01:19,523 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-18 05:01:19,741 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-07-18 05:01:20,205 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-18 05:01:20,433 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-07-18 05:01:20,828 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-18 05:01:21,168 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-07-18 05:01:21,473 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2020-07-18 05:01:21,690 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2020-07-18 05:01:21,725 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 05:01:21,726 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-18 05:01:21,726 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:01:21,726 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-18 05:01:21,726 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:01:21,726 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 05:01:21,726 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 05:01:21,726 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 05:01:21,726 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 05:01:21,727 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-18 05:01:21,727 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 05:01:21,727 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 05:01:21,727 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-18 05:01:21,727 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-18 05:01:21,727 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-07-18 05:01:21,727 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-07-18 05:01:21,727 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-18 05:01:21,727 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-07-18 05:01:21,727 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-18 05:01:21,728 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-18 05:01:21,728 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-07-18 05:01:21,728 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-18 05:01:21,728 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-18 05:01:21,728 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-18 05:01:21,728 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-18 05:01:21,728 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-18 05:01:21,728 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-18 05:01:21,728 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-18 05:01:21,728 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-18 05:01:21,729 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-18 05:01:21,729 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-18 05:01:21,729 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-18 05:01:21,729 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-18 05:01:21,729 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-18 05:01:21,729 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-18 05:01:21,729 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-18 05:01:21,729 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-18 05:01:21,729 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-18 05:01:21,730 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-18 05:01:21,730 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-18 05:01:21,730 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-18 05:01:21,730 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-18 05:01:21,730 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-07-18 05:01:21,730 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-18 05:01:21,731 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-18 05:01:21,731 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-18 05:01:21,731 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-18 05:01:21,731 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-18 05:01:21,731 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-18 05:01:21,731 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-18 05:01:21,732 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-18 05:01:21,732 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-18 05:01:21,732 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-18 05:01:21,732 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-18 05:01:21,733 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-18 05:01:21,733 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-18 05:01:21,733 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-18 05:01:21,733 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-18 05:01:21,733 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-18 05:01:21,733 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-18 05:01:21,734 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-18 05:01:21,734 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-18 05:01:21,734 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-18 05:01:21,734 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-18 05:01:21,735 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 (<= .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-18 05:01:21,735 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-18 05:01:21,735 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-18 05:01:21,735 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-18 05:01:21,736 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-18 05:01:21,736 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-18 05:01:21,736 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-18 05:01:21,736 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-18 05:01:21,737 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-18 05:01:21,737 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-18 05:01:21,737 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-18 05:01:21,737 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-18 05:01:21,738 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-18 05:01:21,738 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-18 05:01:21,738 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-18 05:01:21,738 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-18 05:01:21,738 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-18 05:01:21,738 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 05:01:21,738 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-18 05:01:21,739 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 05:01:21,739 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-18 05:01:21,739 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-18 05:01:21,739 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-18 05:01:21,821 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-18 05:01:21,844 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-18 05:01:21,853 INFO L168 Benchmark]: Toolchain (without parser) took 76125.07 ms. Allocated memory was 137.9 MB in the beginning and 575.7 MB in the end (delta: 437.8 MB). Free memory was 102.3 MB in the beginning and 436.9 MB in the end (delta: -334.6 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. [2020-07-18 05:01:21,855 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 05:01:21,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.13 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 181.4 MB in the end (delta: -79.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-07-18 05:01:21,856 INFO L168 Benchmark]: Boogie Preprocessor took 41.20 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-18 05:01:21,857 INFO L168 Benchmark]: RCFGBuilder took 600.06 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 141.8 MB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. [2020-07-18 05:01:21,862 INFO L168 Benchmark]: TraceAbstraction took 74972.57 ms. Allocated memory was 202.4 MB in the beginning and 575.7 MB in the end (delta: 373.3 MB). Free memory was 141.8 MB in the beginning and 436.9 MB in the end (delta: -295.1 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. [2020-07-18 05:01:21,869 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.25 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 503.13 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 102.1 MB in the beginning and 181.4 MB in the end (delta: -79.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.20 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 600.06 ms. Allocated memory is still 202.4 MB. Free memory was 179.0 MB in the beginning and 141.8 MB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74972.57 ms. Allocated memory was 202.4 MB in the beginning and 575.7 MB in the end (delta: 373.3 MB). Free memory was 141.8 MB in the beginning and 436.9 MB in the end (delta: -295.1 MB). Peak memory consumption was 78.2 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...