/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.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:54:16,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:54:16,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:54:16,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:54:16,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:54:16,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:54:16,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:54:16,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:54:16,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:54:16,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:54:16,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:54:16,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:54:16,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:54:16,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:54:16,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:54:16,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:54:16,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:54:16,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:54:16,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:54:16,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:54:16,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:54:16,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:54:16,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:54:16,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:54:16,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:54:16,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:54:16,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:54:16,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:54:16,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:54:16,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:54:16,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:54:16,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:54:16,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:54:16,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:54:16,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:54:16,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:54:16,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:54:16,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:54:16,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:54:16,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:54:16,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:54:16,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:54:16,661 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:54:16,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:54:16,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:54:16,663 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:54:16,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:54:16,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:54:16,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:54:16,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:54:16,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:54:16,664 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:54:16,664 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:54:16,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:54:16,664 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:54:16,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:54:16,665 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:54:16,665 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:54:16,665 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:54:16,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:54:16,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:54:16,666 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:54:16,666 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:54:16,667 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:54:16,667 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:54:16,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:54:17,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:54:17,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:54:17,008 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:54:17,009 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:54:17,010 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-07-11 00:54:17,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b61c755/0852e830ee2b4d049b6bf5904c127fcb/FLAGf9800139a [2020-07-11 00:54:17,492 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:54:17,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2020-07-11 00:54:17,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b61c755/0852e830ee2b4d049b6bf5904c127fcb/FLAGf9800139a [2020-07-11 00:54:17,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b61c755/0852e830ee2b4d049b6bf5904c127fcb [2020-07-11 00:54:17,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:54:17,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:54:17,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:54:17,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:54:17,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:54:17,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:54:17" (1/1) ... [2020-07-11 00:54:17,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae21815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:17, skipping insertion in model container [2020-07-11 00:54:17,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:54:17" (1/1) ... [2020-07-11 00:54:17,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:54:17,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:54:18,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:54:18,193 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:54:18,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:54:18,237 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:54:18,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18 WrapperNode [2020-07-11 00:54:18,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:54:18,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:54:18,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:54:18,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:54:18,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (1/1) ... [2020-07-11 00:54:18,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (1/1) ... [2020-07-11 00:54:18,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (1/1) ... [2020-07-11 00:54:18,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (1/1) ... [2020-07-11 00:54:18,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (1/1) ... [2020-07-11 00:54:18,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (1/1) ... [2020-07-11 00:54:18,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (1/1) ... [2020-07-11 00:54:18,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:54:18,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:54:18,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:54:18,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:54:18,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:54:18,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:54:18,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:54:18,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 00:54:18,450 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 00:54:18,450 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-11 00:54:18,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:54:18,451 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-11 00:54:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 00:54:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 00:54:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:54:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 00:54:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 00:54:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 00:54:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:54:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-11 00:54:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 00:54:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:54:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 00:54:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-11 00:54:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 00:54:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:54:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:54:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 00:54:19,007 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:54:19,007 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:54:19,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:54:19 BoogieIcfgContainer [2020-07-11 00:54:19,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:54:19,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:54:19,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:54:19,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:54:19,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:54:17" (1/3) ... [2020-07-11 00:54:19,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5bf18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:54:19, skipping insertion in model container [2020-07-11 00:54:19,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:54:18" (2/3) ... [2020-07-11 00:54:19,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5bf18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:54:19, skipping insertion in model container [2020-07-11 00:54:19,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:54:19" (3/3) ... [2020-07-11 00:54:19,024 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2020-07-11 00:54:19,036 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:54:19,045 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:54:19,062 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:54:19,088 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:54:19,089 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:54:19,089 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:54:19,089 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:54:19,090 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:54:19,090 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:54:19,090 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:54:19,090 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:54:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-11 00:54:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-11 00:54:19,126 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:19,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:54:19,128 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1490874143, now seen corresponding path program 1 times [2020-07-11 00:54:19,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:19,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [23361003] [2020-07-11 00:54:19,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:19,568 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {81#true} is VALID [2020-07-11 00:54:19,569 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#true} #valid := #valid[0 := 0]; {81#true} is VALID [2020-07-11 00:54:19,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {81#true} assume 0 < #StackHeapBarrier; {81#true} is VALID [2020-07-11 00:54:19,570 INFO L280 TraceCheckUtils]: 3: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-11 00:54:19,570 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {81#true} {81#true} #104#return; {81#true} is VALID [2020-07-11 00:54:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:19,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {81#true} ~cond := #in~cond; {81#true} is VALID [2020-07-11 00:54:19,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#true} assume !(0 == ~cond); {81#true} is VALID [2020-07-11 00:54:19,583 INFO L280 TraceCheckUtils]: 2: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-11 00:54:19,584 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {81#true} {81#true} #90#return; {81#true} is VALID [2020-07-11 00:54:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:19,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {102#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {81#true} is VALID [2020-07-11 00:54:19,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-11 00:54:19,609 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {81#true} {81#true} #92#return; {81#true} is VALID [2020-07-11 00:54:19,611 INFO L263 TraceCheckUtils]: 0: Hoare triple {81#true} call ULTIMATE.init(); {101#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:54:19,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {81#true} is VALID [2020-07-11 00:54:19,612 INFO L280 TraceCheckUtils]: 2: Hoare triple {81#true} #valid := #valid[0 := 0]; {81#true} is VALID [2020-07-11 00:54:19,613 INFO L280 TraceCheckUtils]: 3: Hoare triple {81#true} assume 0 < #StackHeapBarrier; {81#true} is VALID [2020-07-11 00:54:19,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-11 00:54:19,613 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {81#true} {81#true} #104#return; {81#true} is VALID [2020-07-11 00:54:19,614 INFO L263 TraceCheckUtils]: 6: Hoare triple {81#true} call #t~ret12 := main(); {81#true} is VALID [2020-07-11 00:54:19,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {81#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {81#true} is VALID [2020-07-11 00:54:19,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {81#true} ~n~0 := #t~nondet9; {81#true} is VALID [2020-07-11 00:54:19,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {81#true} havoc #t~nondet9; {81#true} is VALID [2020-07-11 00:54:19,616 INFO L263 TraceCheckUtils]: 10: Hoare triple {81#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {81#true} is VALID [2020-07-11 00:54:19,616 INFO L280 TraceCheckUtils]: 11: Hoare triple {81#true} ~cond := #in~cond; {81#true} is VALID [2020-07-11 00:54:19,616 INFO L280 TraceCheckUtils]: 12: Hoare triple {81#true} assume !(0 == ~cond); {81#true} is VALID [2020-07-11 00:54:19,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-11 00:54:19,617 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {81#true} {81#true} #90#return; {81#true} is VALID [2020-07-11 00:54:19,618 INFO L280 TraceCheckUtils]: 15: Hoare triple {81#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L42-1 {81#true} is VALID [2020-07-11 00:54:19,620 INFO L263 TraceCheckUtils]: 16: Hoare triple {81#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {102#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 00:54:19,621 INFO L280 TraceCheckUtils]: 17: Hoare triple {102#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {81#true} is VALID [2020-07-11 00:54:19,621 INFO L280 TraceCheckUtils]: 18: Hoare triple {81#true} assume true; {81#true} is VALID [2020-07-11 00:54:19,622 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {81#true} {81#true} #92#return; {81#true} is VALID [2020-07-11 00:54:19,622 INFO L280 TraceCheckUtils]: 20: Hoare triple {81#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {81#true} is VALID [2020-07-11 00:54:19,625 INFO L263 TraceCheckUtils]: 21: Hoare triple {81#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~n~0); {95#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-11 00:54:19,626 INFO L280 TraceCheckUtils]: 22: Hoare triple {95#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {96#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-11 00:54:19,628 INFO L280 TraceCheckUtils]: 23: Hoare triple {96#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {97#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-11 00:54:19,629 INFO L280 TraceCheckUtils]: 24: Hoare triple {97#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {97#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-11 00:54:19,630 INFO L280 TraceCheckUtils]: 25: Hoare triple {97#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {98#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:19,632 INFO L280 TraceCheckUtils]: 26: Hoare triple {98#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {98#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:19,634 INFO L263 TraceCheckUtils]: 27: Hoare triple {98#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {99#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 00:54:19,635 INFO L280 TraceCheckUtils]: 28: Hoare triple {99#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {100#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 00:54:19,636 INFO L280 TraceCheckUtils]: 29: Hoare triple {100#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {82#false} is VALID [2020-07-11 00:54:19,636 INFO L280 TraceCheckUtils]: 30: Hoare triple {82#false} assume !false; {82#false} is VALID [2020-07-11 00:54:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:54:19,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [23361003] [2020-07-11 00:54:19,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:54:19,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 00:54:19,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800373487] [2020-07-11 00:54:19,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-11 00:54:19,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:19,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 00:54:19,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:19,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 00:54:19,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:19,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 00:54:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 00:54:19,746 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 10 states. [2020-07-11 00:54:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:22,988 INFO L93 Difference]: Finished difference Result 209 states and 241 transitions. [2020-07-11 00:54:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 00:54:22,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-07-11 00:54:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:54:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 241 transitions. [2020-07-11 00:54:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 00:54:23,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 241 transitions. [2020-07-11 00:54:23,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 241 transitions. [2020-07-11 00:54:23,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:23,410 INFO L225 Difference]: With dead ends: 209 [2020-07-11 00:54:23,410 INFO L226 Difference]: Without dead ends: 123 [2020-07-11 00:54:23,417 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-07-11 00:54:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-11 00:54:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2020-07-11 00:54:23,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:23,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 108 states. [2020-07-11 00:54:23,801 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 108 states. [2020-07-11 00:54:23,802 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 108 states. [2020-07-11 00:54:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:23,813 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2020-07-11 00:54:23,813 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2020-07-11 00:54:23,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:23,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:23,822 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 123 states. [2020-07-11 00:54:23,822 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 123 states. [2020-07-11 00:54:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:23,838 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2020-07-11 00:54:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2020-07-11 00:54:23,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:23,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:23,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:23,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-11 00:54:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2020-07-11 00:54:23,860 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 31 [2020-07-11 00:54:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:23,861 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2020-07-11 00:54:23,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 00:54:23,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 108 states and 115 transitions. [2020-07-11 00:54:24,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2020-07-11 00:54:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 00:54:24,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:24,053 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:54:24,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:54:24,056 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:24,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:24,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1249778318, now seen corresponding path program 1 times [2020-07-11 00:54:24,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:24,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [834804011] [2020-07-11 00:54:24,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:24,449 INFO L280 TraceCheckUtils]: 0: Hoare triple {1031#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1002#true} is VALID [2020-07-11 00:54:24,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {1002#true} #valid := #valid[0 := 0]; {1002#true} is VALID [2020-07-11 00:54:24,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {1002#true} assume 0 < #StackHeapBarrier; {1002#true} is VALID [2020-07-11 00:54:24,450 INFO L280 TraceCheckUtils]: 3: Hoare triple {1002#true} assume true; {1002#true} is VALID [2020-07-11 00:54:24,450 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1002#true} {1002#true} #104#return; {1002#true} is VALID [2020-07-11 00:54:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:24,474 INFO L280 TraceCheckUtils]: 0: Hoare triple {1002#true} ~cond := #in~cond; {1002#true} is VALID [2020-07-11 00:54:24,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {1002#true} assume !(0 == ~cond); {1002#true} is VALID [2020-07-11 00:54:24,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {1002#true} assume true; {1002#true} is VALID [2020-07-11 00:54:24,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1002#true} {1002#true} #90#return; {1002#true} is VALID [2020-07-11 00:54:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:24,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {1032#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1002#true} is VALID [2020-07-11 00:54:24,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {1002#true} assume true; {1002#true} is VALID [2020-07-11 00:54:24,511 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1002#true} {1002#true} #92#return; {1002#true} is VALID [2020-07-11 00:54:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:24,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {1002#true} ~cond := #in~cond; {1002#true} is VALID [2020-07-11 00:54:24,527 INFO L280 TraceCheckUtils]: 1: Hoare triple {1002#true} assume !(0 == ~cond); {1002#true} is VALID [2020-07-11 00:54:24,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {1002#true} assume true; {1002#true} is VALID [2020-07-11 00:54:24,528 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1002#true} {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #96#return; {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,529 INFO L263 TraceCheckUtils]: 0: Hoare triple {1002#true} call ULTIMATE.init(); {1031#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:54:24,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {1031#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1002#true} is VALID [2020-07-11 00:54:24,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {1002#true} #valid := #valid[0 := 0]; {1002#true} is VALID [2020-07-11 00:54:24,530 INFO L280 TraceCheckUtils]: 3: Hoare triple {1002#true} assume 0 < #StackHeapBarrier; {1002#true} is VALID [2020-07-11 00:54:24,530 INFO L280 TraceCheckUtils]: 4: Hoare triple {1002#true} assume true; {1002#true} is VALID [2020-07-11 00:54:24,530 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1002#true} {1002#true} #104#return; {1002#true} is VALID [2020-07-11 00:54:24,531 INFO L263 TraceCheckUtils]: 6: Hoare triple {1002#true} call #t~ret12 := main(); {1002#true} is VALID [2020-07-11 00:54:24,531 INFO L280 TraceCheckUtils]: 7: Hoare triple {1002#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1002#true} is VALID [2020-07-11 00:54:24,531 INFO L280 TraceCheckUtils]: 8: Hoare triple {1002#true} ~n~0 := #t~nondet9; {1002#true} is VALID [2020-07-11 00:54:24,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {1002#true} havoc #t~nondet9; {1002#true} is VALID [2020-07-11 00:54:24,532 INFO L263 TraceCheckUtils]: 10: Hoare triple {1002#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1002#true} is VALID [2020-07-11 00:54:24,532 INFO L280 TraceCheckUtils]: 11: Hoare triple {1002#true} ~cond := #in~cond; {1002#true} is VALID [2020-07-11 00:54:24,532 INFO L280 TraceCheckUtils]: 12: Hoare triple {1002#true} assume !(0 == ~cond); {1002#true} is VALID [2020-07-11 00:54:24,532 INFO L280 TraceCheckUtils]: 13: Hoare triple {1002#true} assume true; {1002#true} is VALID [2020-07-11 00:54:24,533 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1002#true} {1002#true} #90#return; {1002#true} is VALID [2020-07-11 00:54:24,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {1002#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L42-1 {1002#true} is VALID [2020-07-11 00:54:24,534 INFO L263 TraceCheckUtils]: 16: Hoare triple {1002#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {1032#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 00:54:24,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {1032#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1002#true} is VALID [2020-07-11 00:54:24,535 INFO L280 TraceCheckUtils]: 18: Hoare triple {1002#true} assume true; {1002#true} is VALID [2020-07-11 00:54:24,535 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1002#true} {1002#true} #92#return; {1002#true} is VALID [2020-07-11 00:54:24,535 INFO L280 TraceCheckUtils]: 20: Hoare triple {1002#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {1002#true} is VALID [2020-07-11 00:54:24,536 INFO L263 TraceCheckUtils]: 21: Hoare triple {1002#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~n~0); {1016#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-11 00:54:24,538 INFO L280 TraceCheckUtils]: 22: Hoare triple {1016#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {1017#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-11 00:54:24,538 INFO L280 TraceCheckUtils]: 23: Hoare triple {1017#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {1018#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-11 00:54:24,539 INFO L280 TraceCheckUtils]: 24: Hoare triple {1018#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1018#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-11 00:54:24,539 INFO L280 TraceCheckUtils]: 25: Hoare triple {1018#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,540 INFO L280 TraceCheckUtils]: 26: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,540 INFO L263 TraceCheckUtils]: 27: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1002#true} is VALID [2020-07-11 00:54:24,540 INFO L280 TraceCheckUtils]: 28: Hoare triple {1002#true} ~cond := #in~cond; {1002#true} is VALID [2020-07-11 00:54:24,541 INFO L280 TraceCheckUtils]: 29: Hoare triple {1002#true} assume !(0 == ~cond); {1002#true} is VALID [2020-07-11 00:54:24,541 INFO L280 TraceCheckUtils]: 30: Hoare triple {1002#true} assume true; {1002#true} is VALID [2020-07-11 00:54:24,542 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1002#true} {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #96#return; {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,543 INFO L280 TraceCheckUtils]: 32: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,544 INFO L280 TraceCheckUtils]: 33: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,544 INFO L280 TraceCheckUtils]: 34: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L23 {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,545 INFO L280 TraceCheckUtils]: 35: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L23-1 {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,546 INFO L280 TraceCheckUtils]: 36: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,546 INFO L280 TraceCheckUtils]: 37: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,547 INFO L280 TraceCheckUtils]: 38: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,547 INFO L280 TraceCheckUtils]: 39: Hoare triple {1019#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {1024#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:24,549 INFO L280 TraceCheckUtils]: 40: Hoare triple {1024#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {1025#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:24,549 INFO L280 TraceCheckUtils]: 41: Hoare triple {1025#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {1025#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:24,550 INFO L263 TraceCheckUtils]: 42: Hoare triple {1025#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {1026#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-11 00:54:24,558 INFO L280 TraceCheckUtils]: 43: Hoare triple {1026#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {1027#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-11 00:54:24,561 INFO L280 TraceCheckUtils]: 44: Hoare triple {1027#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {1028#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-11 00:54:24,562 INFO L280 TraceCheckUtils]: 45: Hoare triple {1028#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1028#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-11 00:54:24,563 INFO L280 TraceCheckUtils]: 46: Hoare triple {1028#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {1025#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:24,565 INFO L280 TraceCheckUtils]: 47: Hoare triple {1025#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {1025#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:24,566 INFO L263 TraceCheckUtils]: 48: Hoare triple {1025#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {1029#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 00:54:24,567 INFO L280 TraceCheckUtils]: 49: Hoare triple {1029#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1030#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 00:54:24,569 INFO L280 TraceCheckUtils]: 50: Hoare triple {1030#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1003#false} is VALID [2020-07-11 00:54:24,569 INFO L280 TraceCheckUtils]: 51: Hoare triple {1003#false} assume !false; {1003#false} is VALID [2020-07-11 00:54:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:54:24,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [834804011] [2020-07-11 00:54:24,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:54:24,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 00:54:24,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353047192] [2020-07-11 00:54:24,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-07-11 00:54:24,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:24,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 00:54:24,655 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:24,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 00:54:24,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 00:54:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:54:24,656 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 15 states. [2020-07-11 00:54:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:30,959 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2020-07-11 00:54:30,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-11 00:54:30,960 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-07-11 00:54:30,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 202 transitions. [2020-07-11 00:54:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 202 transitions. [2020-07-11 00:54:30,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 202 transitions. [2020-07-11 00:54:31,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:31,368 INFO L225 Difference]: With dead ends: 189 [2020-07-11 00:54:31,369 INFO L226 Difference]: Without dead ends: 187 [2020-07-11 00:54:31,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-07-11 00:54:31,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-07-11 00:54:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 153. [2020-07-11 00:54:31,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:31,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand 153 states. [2020-07-11 00:54:31,864 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand 153 states. [2020-07-11 00:54:31,864 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 153 states. [2020-07-11 00:54:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:31,887 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2020-07-11 00:54:31,887 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 203 transitions. [2020-07-11 00:54:31,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:31,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:31,890 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 187 states. [2020-07-11 00:54:31,890 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 187 states. [2020-07-11 00:54:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:31,902 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2020-07-11 00:54:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 203 transitions. [2020-07-11 00:54:31,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:31,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:31,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:31,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-07-11 00:54:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2020-07-11 00:54:31,915 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 52 [2020-07-11 00:54:31,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:31,915 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2020-07-11 00:54:31,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 00:54:31,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 153 states and 165 transitions. [2020-07-11 00:54:32,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2020-07-11 00:54:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 00:54:32,220 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:32,220 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:54:32,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:54:32,220 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:32,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:32,221 INFO L82 PathProgramCache]: Analyzing trace with hash -448975570, now seen corresponding path program 1 times [2020-07-11 00:54:32,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:32,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141093553] [2020-07-11 00:54:32,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,385 INFO L280 TraceCheckUtils]: 0: Hoare triple {2149#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2125#true} is VALID [2020-07-11 00:54:32,385 INFO L280 TraceCheckUtils]: 1: Hoare triple {2125#true} #valid := #valid[0 := 0]; {2125#true} is VALID [2020-07-11 00:54:32,385 INFO L280 TraceCheckUtils]: 2: Hoare triple {2125#true} assume 0 < #StackHeapBarrier; {2125#true} is VALID [2020-07-11 00:54:32,385 INFO L280 TraceCheckUtils]: 3: Hoare triple {2125#true} assume true; {2125#true} is VALID [2020-07-11 00:54:32,386 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2125#true} {2125#true} #104#return; {2125#true} is VALID [2020-07-11 00:54:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {2125#true} ~cond := #in~cond; {2125#true} is VALID [2020-07-11 00:54:32,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {2125#true} assume !(0 == ~cond); {2125#true} is VALID [2020-07-11 00:54:32,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {2125#true} assume true; {2125#true} is VALID [2020-07-11 00:54:32,391 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2125#true} {2125#true} #90#return; {2125#true} is VALID [2020-07-11 00:54:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {2150#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2151#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-11 00:54:32,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {2151#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {2151#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-11 00:54:32,437 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2151#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {2125#true} #92#return; {2139#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-11 00:54:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:32,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {2125#true} ~cond := #in~cond; {2125#true} is VALID [2020-07-11 00:54:32,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {2125#true} assume !(0 == ~cond); {2125#true} is VALID [2020-07-11 00:54:32,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {2125#true} assume true; {2125#true} is VALID [2020-07-11 00:54:32,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2125#true} {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #96#return; {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:32,446 INFO L263 TraceCheckUtils]: 0: Hoare triple {2125#true} call ULTIMATE.init(); {2149#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:54:32,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {2149#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2125#true} is VALID [2020-07-11 00:54:32,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {2125#true} #valid := #valid[0 := 0]; {2125#true} is VALID [2020-07-11 00:54:32,447 INFO L280 TraceCheckUtils]: 3: Hoare triple {2125#true} assume 0 < #StackHeapBarrier; {2125#true} is VALID [2020-07-11 00:54:32,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {2125#true} assume true; {2125#true} is VALID [2020-07-11 00:54:32,448 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2125#true} {2125#true} #104#return; {2125#true} is VALID [2020-07-11 00:54:32,448 INFO L263 TraceCheckUtils]: 6: Hoare triple {2125#true} call #t~ret12 := main(); {2125#true} is VALID [2020-07-11 00:54:32,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {2125#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2125#true} is VALID [2020-07-11 00:54:32,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {2125#true} ~n~0 := #t~nondet9; {2125#true} is VALID [2020-07-11 00:54:32,449 INFO L280 TraceCheckUtils]: 9: Hoare triple {2125#true} havoc #t~nondet9; {2125#true} is VALID [2020-07-11 00:54:32,449 INFO L263 TraceCheckUtils]: 10: Hoare triple {2125#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {2125#true} is VALID [2020-07-11 00:54:32,449 INFO L280 TraceCheckUtils]: 11: Hoare triple {2125#true} ~cond := #in~cond; {2125#true} is VALID [2020-07-11 00:54:32,450 INFO L280 TraceCheckUtils]: 12: Hoare triple {2125#true} assume !(0 == ~cond); {2125#true} is VALID [2020-07-11 00:54:32,450 INFO L280 TraceCheckUtils]: 13: Hoare triple {2125#true} assume true; {2125#true} is VALID [2020-07-11 00:54:32,450 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2125#true} {2125#true} #90#return; {2125#true} is VALID [2020-07-11 00:54:32,450 INFO L280 TraceCheckUtils]: 15: Hoare triple {2125#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L42-1 {2125#true} is VALID [2020-07-11 00:54:32,452 INFO L263 TraceCheckUtils]: 16: Hoare triple {2125#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {2150#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 00:54:32,453 INFO L280 TraceCheckUtils]: 17: Hoare triple {2150#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2151#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-11 00:54:32,453 INFO L280 TraceCheckUtils]: 18: Hoare triple {2151#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {2151#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-11 00:54:32,455 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2151#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {2125#true} #92#return; {2139#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-11 00:54:32,456 INFO L280 TraceCheckUtils]: 20: Hoare triple {2139#(= ((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; {2140#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-11 00:54:32,457 INFO L263 TraceCheckUtils]: 21: Hoare triple {2140#(= ((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, ~n~0); {2141#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-11 00:54:32,457 INFO L280 TraceCheckUtils]: 22: Hoare triple {2141#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {2141#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-11 00:54:32,458 INFO L280 TraceCheckUtils]: 23: Hoare triple {2141#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {2141#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-11 00:54:32,458 INFO L280 TraceCheckUtils]: 24: Hoare triple {2141#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:32,459 INFO L280 TraceCheckUtils]: 25: Hoare triple {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:32,459 INFO L280 TraceCheckUtils]: 26: Hoare triple {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:32,459 INFO L263 TraceCheckUtils]: 27: Hoare triple {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {2125#true} is VALID [2020-07-11 00:54:32,460 INFO L280 TraceCheckUtils]: 28: Hoare triple {2125#true} ~cond := #in~cond; {2125#true} is VALID [2020-07-11 00:54:32,460 INFO L280 TraceCheckUtils]: 29: Hoare triple {2125#true} assume !(0 == ~cond); {2125#true} is VALID [2020-07-11 00:54:32,460 INFO L280 TraceCheckUtils]: 30: Hoare triple {2125#true} assume true; {2125#true} is VALID [2020-07-11 00:54:32,461 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2125#true} {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #96#return; {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:32,462 INFO L280 TraceCheckUtils]: 32: Hoare triple {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:32,462 INFO L280 TraceCheckUtils]: 33: Hoare triple {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {2142#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:32,463 INFO L280 TraceCheckUtils]: 34: Hoare triple {2142#(= ((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: L23 {2147#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem1|))} is VALID [2020-07-11 00:54:32,463 INFO L280 TraceCheckUtils]: 35: Hoare triple {2147#(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: L23-1 {2148#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} is VALID [2020-07-11 00:54:32,464 INFO L280 TraceCheckUtils]: 36: Hoare triple {2148#(and (= 0 |check_#t~mem1|) (= 0 |check_#t~mem2|))} assume !(#t~mem1 <= #t~mem2); {2126#false} is VALID [2020-07-11 00:54:32,464 INFO L280 TraceCheckUtils]: 37: Hoare triple {2126#false} havoc #t~mem1; {2126#false} is VALID [2020-07-11 00:54:32,464 INFO L280 TraceCheckUtils]: 38: Hoare triple {2126#false} havoc #t~mem2; {2126#false} is VALID [2020-07-11 00:54:32,465 INFO L280 TraceCheckUtils]: 39: Hoare triple {2126#false} #t~post4 := ~y; {2126#false} is VALID [2020-07-11 00:54:32,465 INFO L280 TraceCheckUtils]: 40: Hoare triple {2126#false} ~y := #t~post4 - 1; {2126#false} is VALID [2020-07-11 00:54:32,465 INFO L280 TraceCheckUtils]: 41: Hoare triple {2126#false} havoc #t~post4; {2126#false} is VALID [2020-07-11 00:54:32,465 INFO L263 TraceCheckUtils]: 42: Hoare triple {2126#false} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {2126#false} is VALID [2020-07-11 00:54:32,466 INFO L280 TraceCheckUtils]: 43: Hoare triple {2126#false} ~x := #in~x; {2126#false} is VALID [2020-07-11 00:54:32,466 INFO L280 TraceCheckUtils]: 44: Hoare triple {2126#false} ~y := #in~y; {2126#false} is VALID [2020-07-11 00:54:32,466 INFO L280 TraceCheckUtils]: 45: Hoare triple {2126#false} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {2126#false} is VALID [2020-07-11 00:54:32,466 INFO L280 TraceCheckUtils]: 46: Hoare triple {2126#false} ~n := #in~n; {2126#false} is VALID [2020-07-11 00:54:32,467 INFO L280 TraceCheckUtils]: 47: Hoare triple {2126#false} assume !(~x >= ~y); {2126#false} is VALID [2020-07-11 00:54:32,467 INFO L263 TraceCheckUtils]: 48: Hoare triple {2126#false} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {2126#false} is VALID [2020-07-11 00:54:32,467 INFO L280 TraceCheckUtils]: 49: Hoare triple {2126#false} ~cond := #in~cond; {2126#false} is VALID [2020-07-11 00:54:32,467 INFO L280 TraceCheckUtils]: 50: Hoare triple {2126#false} assume 0 == ~cond; {2126#false} is VALID [2020-07-11 00:54:32,468 INFO L280 TraceCheckUtils]: 51: Hoare triple {2126#false} assume !false; {2126#false} is VALID [2020-07-11 00:54:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:54:32,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141093553] [2020-07-11 00:54:32,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:54:32,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-11 00:54:32,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822004582] [2020-07-11 00:54:32,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-07-11 00:54:32,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:32,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 00:54:32,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:32,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 00:54:32,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:32,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 00:54:32,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-11 00:54:32,525 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand 11 states. [2020-07-11 00:54:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:34,492 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2020-07-11 00:54:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-11 00:54:34,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2020-07-11 00:54:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:54:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2020-07-11 00:54:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 00:54:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2020-07-11 00:54:34,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 121 transitions. [2020-07-11 00:54:34,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:34,682 INFO L225 Difference]: With dead ends: 230 [2020-07-11 00:54:34,682 INFO L226 Difference]: Without dead ends: 137 [2020-07-11 00:54:34,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 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-11 00:54:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-11 00:54:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-07-11 00:54:35,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:35,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 137 states. [2020-07-11 00:54:35,152 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states. [2020-07-11 00:54:35,152 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states. [2020-07-11 00:54:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:35,160 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2020-07-11 00:54:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2020-07-11 00:54:35,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:35,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:35,161 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 137 states. [2020-07-11 00:54:35,162 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 137 states. [2020-07-11 00:54:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:35,169 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2020-07-11 00:54:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2020-07-11 00:54:35,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:35,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:35,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:35,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-11 00:54:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 145 transitions. [2020-07-11 00:54:35,177 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 145 transitions. Word has length 52 [2020-07-11 00:54:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:35,178 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 145 transitions. [2020-07-11 00:54:35,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 00:54:35,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 137 states and 145 transitions. [2020-07-11 00:54:35,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 145 transitions. [2020-07-11 00:54:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-07-11 00:54:35,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:35,486 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:54:35,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:54:35,487 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:35,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1366237712, now seen corresponding path program 1 times [2020-07-11 00:54:35,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:35,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1394130040] [2020-07-11 00:54:35,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:35,728 INFO L280 TraceCheckUtils]: 0: Hoare triple {3217#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3177#true} is VALID [2020-07-11 00:54:35,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {3177#true} #valid := #valid[0 := 0]; {3177#true} is VALID [2020-07-11 00:54:35,729 INFO L280 TraceCheckUtils]: 2: Hoare triple {3177#true} assume 0 < #StackHeapBarrier; {3177#true} is VALID [2020-07-11 00:54:35,729 INFO L280 TraceCheckUtils]: 3: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,730 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3177#true} {3177#true} #104#return; {3177#true} is VALID [2020-07-11 00:54:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:35,740 INFO L280 TraceCheckUtils]: 0: Hoare triple {3177#true} ~cond := #in~cond; {3177#true} is VALID [2020-07-11 00:54:35,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {3177#true} assume !(0 == ~cond); {3177#true} is VALID [2020-07-11 00:54:35,741 INFO L280 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,741 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3177#true} #90#return; {3177#true} is VALID [2020-07-11 00:54:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:35,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {3218#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3219#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-11 00:54:35,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {3219#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {3219#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-11 00:54:35,789 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3219#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {3177#true} #92#return; {3191#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-11 00:54:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:35,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {3177#true} ~cond := #in~cond; {3177#true} is VALID [2020-07-11 00:54:35,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {3177#true} assume !(0 == ~cond); {3177#true} is VALID [2020-07-11 00:54:35,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #96#return; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:35,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {3177#true} ~x := #in~x; {3177#true} is VALID [2020-07-11 00:54:35,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {3177#true} ~y := #in~y; {3177#true} is VALID [2020-07-11 00:54:35,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {3177#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {3177#true} is VALID [2020-07-11 00:54:35,815 INFO L280 TraceCheckUtils]: 3: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2020-07-11 00:54:35,815 INFO L280 TraceCheckUtils]: 4: Hoare triple {3177#true} assume ~x >= ~y; {3177#true} is VALID [2020-07-11 00:54:35,816 INFO L280 TraceCheckUtils]: 5: Hoare triple {3177#true} #res := ~x; {3177#true} is VALID [2020-07-11 00:54:35,816 INFO L280 TraceCheckUtils]: 6: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,817 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {3177#true} {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #98#return; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:35,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {3177#true} ~cond := #in~cond; {3177#true} is VALID [2020-07-11 00:54:35,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {3177#true} assume !(0 == ~cond); {3177#true} is VALID [2020-07-11 00:54:35,825 INFO L280 TraceCheckUtils]: 2: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,827 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3177#true} {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #100#return; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,828 INFO L263 TraceCheckUtils]: 0: Hoare triple {3177#true} call ULTIMATE.init(); {3217#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:54:35,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {3217#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3177#true} is VALID [2020-07-11 00:54:35,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {3177#true} #valid := #valid[0 := 0]; {3177#true} is VALID [2020-07-11 00:54:35,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {3177#true} assume 0 < #StackHeapBarrier; {3177#true} is VALID [2020-07-11 00:54:35,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,830 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3177#true} {3177#true} #104#return; {3177#true} is VALID [2020-07-11 00:54:35,830 INFO L263 TraceCheckUtils]: 6: Hoare triple {3177#true} call #t~ret12 := main(); {3177#true} is VALID [2020-07-11 00:54:35,830 INFO L280 TraceCheckUtils]: 7: Hoare triple {3177#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {3177#true} is VALID [2020-07-11 00:54:35,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {3177#true} ~n~0 := #t~nondet9; {3177#true} is VALID [2020-07-11 00:54:35,831 INFO L280 TraceCheckUtils]: 9: Hoare triple {3177#true} havoc #t~nondet9; {3177#true} is VALID [2020-07-11 00:54:35,831 INFO L263 TraceCheckUtils]: 10: Hoare triple {3177#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {3177#true} is VALID [2020-07-11 00:54:35,831 INFO L280 TraceCheckUtils]: 11: Hoare triple {3177#true} ~cond := #in~cond; {3177#true} is VALID [2020-07-11 00:54:35,831 INFO L280 TraceCheckUtils]: 12: Hoare triple {3177#true} assume !(0 == ~cond); {3177#true} is VALID [2020-07-11 00:54:35,832 INFO L280 TraceCheckUtils]: 13: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,832 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {3177#true} {3177#true} #90#return; {3177#true} is VALID [2020-07-11 00:54:35,832 INFO L280 TraceCheckUtils]: 15: Hoare triple {3177#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L42-1 {3177#true} is VALID [2020-07-11 00:54:35,833 INFO L263 TraceCheckUtils]: 16: Hoare triple {3177#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {3218#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 00:54:35,834 INFO L280 TraceCheckUtils]: 17: Hoare triple {3218#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3219#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-11 00:54:35,835 INFO L280 TraceCheckUtils]: 18: Hoare triple {3219#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {3219#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2020-07-11 00:54:35,836 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {3219#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {3177#true} #92#return; {3191#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|))} is VALID [2020-07-11 00:54:35,837 INFO L280 TraceCheckUtils]: 20: Hoare triple {3191#(= ((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; {3192#(= ((as const (Array Int Int)) 0) (select |#memory_int| main_~a~0.base))} is VALID [2020-07-11 00:54:35,838 INFO L263 TraceCheckUtils]: 21: Hoare triple {3192#(= ((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, ~n~0); {3193#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-11 00:54:35,839 INFO L280 TraceCheckUtils]: 22: Hoare triple {3193#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~x := #in~x; {3193#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-11 00:54:35,839 INFO L280 TraceCheckUtils]: 23: Hoare triple {3193#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~y := #in~y; {3193#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} is VALID [2020-07-11 00:54:35,844 INFO L280 TraceCheckUtils]: 24: Hoare triple {3193#(= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,848 INFO L280 TraceCheckUtils]: 25: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~n := #in~n; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,849 INFO L280 TraceCheckUtils]: 26: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume !(~x >= ~y); {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,849 INFO L263 TraceCheckUtils]: 27: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {3177#true} is VALID [2020-07-11 00:54:35,849 INFO L280 TraceCheckUtils]: 28: Hoare triple {3177#true} ~cond := #in~cond; {3177#true} is VALID [2020-07-11 00:54:35,849 INFO L280 TraceCheckUtils]: 29: Hoare triple {3177#true} assume !(0 == ~cond); {3177#true} is VALID [2020-07-11 00:54:35,850 INFO L280 TraceCheckUtils]: 30: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,851 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3177#true} {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #96#return; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,851 INFO L280 TraceCheckUtils]: 32: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x0~0 := ~x; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,852 INFO L280 TraceCheckUtils]: 33: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~y0~0 := ~y; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,852 INFO L280 TraceCheckUtils]: 34: Hoare triple {3194#(= ((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: L23 {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,853 INFO L280 TraceCheckUtils]: 35: Hoare triple {3194#(= ((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: L23-1 {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,854 INFO L280 TraceCheckUtils]: 36: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume #t~mem1 <= #t~mem2; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,854 INFO L280 TraceCheckUtils]: 37: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem1; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,855 INFO L280 TraceCheckUtils]: 38: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~mem2; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,856 INFO L280 TraceCheckUtils]: 39: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #t~post3 := ~x; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,856 INFO L280 TraceCheckUtils]: 40: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x := 1 + #t~post3; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,857 INFO L280 TraceCheckUtils]: 41: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~post3; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,857 INFO L263 TraceCheckUtils]: 42: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {3177#true} is VALID [2020-07-11 00:54:35,858 INFO L280 TraceCheckUtils]: 43: Hoare triple {3177#true} ~x := #in~x; {3177#true} is VALID [2020-07-11 00:54:35,858 INFO L280 TraceCheckUtils]: 44: Hoare triple {3177#true} ~y := #in~y; {3177#true} is VALID [2020-07-11 00:54:35,858 INFO L280 TraceCheckUtils]: 45: Hoare triple {3177#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {3177#true} is VALID [2020-07-11 00:54:35,860 INFO L280 TraceCheckUtils]: 46: Hoare triple {3177#true} ~n := #in~n; {3177#true} is VALID [2020-07-11 00:54:35,860 INFO L280 TraceCheckUtils]: 47: Hoare triple {3177#true} assume ~x >= ~y; {3177#true} is VALID [2020-07-11 00:54:35,863 INFO L280 TraceCheckUtils]: 48: Hoare triple {3177#true} #res := ~x; {3177#true} is VALID [2020-07-11 00:54:35,864 INFO L280 TraceCheckUtils]: 49: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,868 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {3177#true} {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #98#return; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,870 INFO L280 TraceCheckUtils]: 51: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,871 INFO L280 TraceCheckUtils]: 52: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~x1~0 := #t~ret5; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,871 INFO L280 TraceCheckUtils]: 53: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~ret5; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,872 INFO L280 TraceCheckUtils]: 54: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,872 INFO L280 TraceCheckUtils]: 55: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} ~i~0 := #t~nondet6; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,873 INFO L280 TraceCheckUtils]: 56: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} havoc #t~nondet6; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,873 INFO L263 TraceCheckUtils]: 57: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} call assume_abort_if_not((if ~x0~0 <= ~i~0 && ~i~0 <= ~y0~0 then 1 else 0)); {3177#true} is VALID [2020-07-11 00:54:35,873 INFO L280 TraceCheckUtils]: 58: Hoare triple {3177#true} ~cond := #in~cond; {3177#true} is VALID [2020-07-11 00:54:35,874 INFO L280 TraceCheckUtils]: 59: Hoare triple {3177#true} assume !(0 == ~cond); {3177#true} is VALID [2020-07-11 00:54:35,874 INFO L280 TraceCheckUtils]: 60: Hoare triple {3177#true} assume true; {3177#true} is VALID [2020-07-11 00:54:35,875 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {3177#true} {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} #100#return; {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} is VALID [2020-07-11 00:54:35,876 INFO L280 TraceCheckUtils]: 62: Hoare triple {3194#(= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base))} SUMMARY for call #t~mem7 := read~int(~a.base, ~a.offset + 4 * ~i~0, 4); srcloc: L31-1 {3211#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem7|))} is VALID [2020-07-11 00:54:35,881 INFO L280 TraceCheckUtils]: 63: Hoare triple {3211#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)) (= 0 |check_#t~mem7|))} ~ai~0 := #t~mem7; {3212#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-11 00:54:35,882 INFO L280 TraceCheckUtils]: 64: Hoare triple {3212#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} havoc #t~mem7; {3212#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} is VALID [2020-07-11 00:54:35,883 INFO L280 TraceCheckUtils]: 65: Hoare triple {3212#(and (= 0 check_~ai~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| check_~a.base)))} SUMMARY for call #t~mem8 := read~int(~a.base, ~a.offset + 4 * ~x1~0, 4); srcloc: L33 {3213#(and (= 0 check_~ai~0) (= 0 |check_#t~mem8|))} is VALID [2020-07-11 00:54:35,884 INFO L280 TraceCheckUtils]: 66: Hoare triple {3213#(and (= 0 check_~ai~0) (= 0 |check_#t~mem8|))} ~ax~0 := #t~mem8; {3214#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-11 00:54:35,884 INFO L280 TraceCheckUtils]: 67: Hoare triple {3214#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} havoc #t~mem8; {3214#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} is VALID [2020-07-11 00:54:35,885 INFO L263 TraceCheckUtils]: 68: Hoare triple {3214#(and (= 0 check_~ax~0) (= 0 check_~ai~0))} call __VERIFIER_assert((if ~ai~0 <= ~ax~0 then 1 else 0)); {3215#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 00:54:35,886 INFO L280 TraceCheckUtils]: 69: Hoare triple {3215#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3216#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 00:54:35,887 INFO L280 TraceCheckUtils]: 70: Hoare triple {3216#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3178#false} is VALID [2020-07-11 00:54:35,887 INFO L280 TraceCheckUtils]: 71: Hoare triple {3178#false} assume !false; {3178#false} is VALID [2020-07-11 00:54:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 00:54:35,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1394130040] [2020-07-11 00:54:35,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:54:35,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 00:54:35,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624350671] [2020-07-11 00:54:35,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-07-11 00:54:35,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:35,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 00:54:35,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:35,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 00:54:35,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:35,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 00:54:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-11 00:54:35,973 INFO L87 Difference]: Start difference. First operand 137 states and 145 transitions. Second operand 15 states. [2020-07-11 00:54:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:38,961 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2020-07-11 00:54:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 00:54:38,962 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2020-07-11 00:54:38,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2020-07-11 00:54:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 00:54:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2020-07-11 00:54:38,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 73 transitions. [2020-07-11 00:54:39,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:39,096 INFO L225 Difference]: With dead ends: 147 [2020-07-11 00:54:39,096 INFO L226 Difference]: Without dead ends: 87 [2020-07-11 00:54:39,097 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-07-11 00:54:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-07-11 00:54:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2020-07-11 00:54:39,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:39,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 76 states. [2020-07-11 00:54:39,312 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 76 states. [2020-07-11 00:54:39,312 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 76 states. [2020-07-11 00:54:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:39,315 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-07-11 00:54:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2020-07-11 00:54:39,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:39,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:39,317 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 87 states. [2020-07-11 00:54:39,317 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 87 states. [2020-07-11 00:54:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:39,321 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-07-11 00:54:39,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2020-07-11 00:54:39,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:39,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:39,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:39,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-11 00:54:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2020-07-11 00:54:39,325 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2020-07-11 00:54:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:39,325 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2020-07-11 00:54:39,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 00:54:39,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 76 transitions. [2020-07-11 00:54:39,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2020-07-11 00:54:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-11 00:54:39,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:54:39,467 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-07-11 00:54:39,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 00:54:39,468 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:54:39,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:54:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2045890305, now seen corresponding path program 2 times [2020-07-11 00:54:39,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:54:39,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [73332264] [2020-07-11 00:54:39,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:54:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {3912#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3874#true} is VALID [2020-07-11 00:54:39,969 INFO L280 TraceCheckUtils]: 1: Hoare triple {3874#true} #valid := #valid[0 := 0]; {3874#true} is VALID [2020-07-11 00:54:39,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {3874#true} assume 0 < #StackHeapBarrier; {3874#true} is VALID [2020-07-11 00:54:39,970 INFO L280 TraceCheckUtils]: 3: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:39,970 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3874#true} {3874#true} #104#return; {3874#true} is VALID [2020-07-11 00:54:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:39,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2020-07-11 00:54:39,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2020-07-11 00:54:39,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:39,976 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3874#true} #90#return; {3874#true} is VALID [2020-07-11 00:54:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:40,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {3913#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3874#true} is VALID [2020-07-11 00:54:40,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:40,004 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3874#true} {3874#true} #92#return; {3874#true} is VALID [2020-07-11 00:54:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:40,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2020-07-11 00:54:40,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2020-07-11 00:54:40,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:40,015 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #96#return; {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:54:40,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2020-07-11 00:54:40,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2020-07-11 00:54:40,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:40,030 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3874#true} {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #96#return; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,031 INFO L263 TraceCheckUtils]: 0: Hoare triple {3874#true} call ULTIMATE.init(); {3912#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 00:54:40,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {3912#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3874#true} is VALID [2020-07-11 00:54:40,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {3874#true} #valid := #valid[0 := 0]; {3874#true} is VALID [2020-07-11 00:54:40,032 INFO L280 TraceCheckUtils]: 3: Hoare triple {3874#true} assume 0 < #StackHeapBarrier; {3874#true} is VALID [2020-07-11 00:54:40,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:40,032 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3874#true} {3874#true} #104#return; {3874#true} is VALID [2020-07-11 00:54:40,033 INFO L263 TraceCheckUtils]: 6: Hoare triple {3874#true} call #t~ret12 := main(); {3874#true} is VALID [2020-07-11 00:54:40,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {3874#true} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {3874#true} is VALID [2020-07-11 00:54:40,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {3874#true} ~n~0 := #t~nondet9; {3874#true} is VALID [2020-07-11 00:54:40,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {3874#true} havoc #t~nondet9; {3874#true} is VALID [2020-07-11 00:54:40,033 INFO L263 TraceCheckUtils]: 10: Hoare triple {3874#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {3874#true} is VALID [2020-07-11 00:54:40,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2020-07-11 00:54:40,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2020-07-11 00:54:40,035 INFO L280 TraceCheckUtils]: 13: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:40,036 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {3874#true} {3874#true} #90#return; {3874#true} is VALID [2020-07-11 00:54:40,036 INFO L280 TraceCheckUtils]: 15: Hoare triple {3874#true} SUMMARY for call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(4 * ~n~0); srcloc: L42-1 {3874#true} is VALID [2020-07-11 00:54:40,041 INFO L263 TraceCheckUtils]: 16: Hoare triple {3874#true} call #Ultimate.meminit(#t~malloc10.base, #t~malloc10.offset, ~n~0, 4, 4 * ~n~0); {3913#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-11 00:54:40,041 INFO L280 TraceCheckUtils]: 17: Hoare triple {3913#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3874#true} is VALID [2020-07-11 00:54:40,041 INFO L280 TraceCheckUtils]: 18: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:40,042 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {3874#true} {3874#true} #92#return; {3874#true} is VALID [2020-07-11 00:54:40,042 INFO L280 TraceCheckUtils]: 20: Hoare triple {3874#true} ~a~0.base, ~a~0.offset := #t~malloc10.base, #t~malloc10.offset; {3874#true} is VALID [2020-07-11 00:54:40,043 INFO L263 TraceCheckUtils]: 21: Hoare triple {3874#true} call #t~ret11 := check(0, ~n~0 - 1, ~a~0.base, ~a~0.offset, ~n~0); {3888#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} is VALID [2020-07-11 00:54:40,044 INFO L280 TraceCheckUtils]: 22: Hoare triple {3888#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (= 0 |check_#in~x|))} ~x := #in~x; {3889#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-11 00:54:40,045 INFO L280 TraceCheckUtils]: 23: Hoare triple {3889#(and (= 0 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {3890#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-11 00:54:40,054 INFO L280 TraceCheckUtils]: 24: Hoare triple {3890#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {3890#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} is VALID [2020-07-11 00:54:40,055 INFO L280 TraceCheckUtils]: 25: Hoare triple {3890#(and (<= (+ check_~y 1) |check_#in~n|) (= 0 check_~x))} ~n := #in~n; {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,056 INFO L280 TraceCheckUtils]: 26: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume !(~x >= ~y); {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,056 INFO L263 TraceCheckUtils]: 27: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {3874#true} is VALID [2020-07-11 00:54:40,057 INFO L280 TraceCheckUtils]: 28: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2020-07-11 00:54:40,057 INFO L280 TraceCheckUtils]: 29: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2020-07-11 00:54:40,057 INFO L280 TraceCheckUtils]: 30: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:40,060 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {3874#true} {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #96#return; {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,061 INFO L280 TraceCheckUtils]: 32: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~x0~0 := ~x; {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,062 INFO L280 TraceCheckUtils]: 33: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} ~y0~0 := ~y; {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,063 INFO L280 TraceCheckUtils]: 34: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L23 {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,064 INFO L280 TraceCheckUtils]: 35: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L23-1 {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,065 INFO L280 TraceCheckUtils]: 36: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} assume #t~mem1 <= #t~mem2; {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,065 INFO L280 TraceCheckUtils]: 37: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem1; {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,066 INFO L280 TraceCheckUtils]: 38: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} havoc #t~mem2; {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,067 INFO L280 TraceCheckUtils]: 39: Hoare triple {3891#(and (= 0 check_~x) (<= (+ check_~y 1) check_~n))} #t~post3 := ~x; {3896#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,067 INFO L280 TraceCheckUtils]: 40: Hoare triple {3896#(and (= 0 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,068 INFO L280 TraceCheckUtils]: 41: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~post3; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,069 INFO L263 TraceCheckUtils]: 42: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {3898#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-11 00:54:40,070 INFO L280 TraceCheckUtils]: 43: Hoare triple {3898#(and (<= 1 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {3899#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-11 00:54:40,071 INFO L280 TraceCheckUtils]: 44: Hoare triple {3899#(and (<= 1 check_~x) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~y := #in~y; {3900#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,072 INFO L280 TraceCheckUtils]: 45: Hoare triple {3900#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {3900#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,072 INFO L280 TraceCheckUtils]: 46: Hoare triple {3900#(and (<= (+ check_~y 1) |check_#in~n|) (<= 1 check_~x))} ~n := #in~n; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,073 INFO L280 TraceCheckUtils]: 47: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume !(~x >= ~y); {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,073 INFO L263 TraceCheckUtils]: 48: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {3874#true} is VALID [2020-07-11 00:54:40,073 INFO L280 TraceCheckUtils]: 49: Hoare triple {3874#true} ~cond := #in~cond; {3874#true} is VALID [2020-07-11 00:54:40,074 INFO L280 TraceCheckUtils]: 50: Hoare triple {3874#true} assume !(0 == ~cond); {3874#true} is VALID [2020-07-11 00:54:40,074 INFO L280 TraceCheckUtils]: 51: Hoare triple {3874#true} assume true; {3874#true} is VALID [2020-07-11 00:54:40,075 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {3874#true} {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #96#return; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,076 INFO L280 TraceCheckUtils]: 53: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~x0~0 := ~x; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,076 INFO L280 TraceCheckUtils]: 54: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} ~y0~0 := ~y; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,079 INFO L280 TraceCheckUtils]: 55: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + 4 * ~x, 4); srcloc: L23 {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,080 INFO L280 TraceCheckUtils]: 56: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} SUMMARY for call #t~mem2 := read~int(~a.base, ~a.offset + 4 * ~y, 4); srcloc: L23-1 {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,080 INFO L280 TraceCheckUtils]: 57: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} assume #t~mem1 <= #t~mem2; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,081 INFO L280 TraceCheckUtils]: 58: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem1; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,082 INFO L280 TraceCheckUtils]: 59: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} havoc #t~mem2; {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} is VALID [2020-07-11 00:54:40,082 INFO L280 TraceCheckUtils]: 60: Hoare triple {3897#(and (<= (+ check_~y 1) check_~n) (<= 1 check_~x))} #t~post3 := ~x; {3905#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} is VALID [2020-07-11 00:54:40,083 INFO L280 TraceCheckUtils]: 61: Hoare triple {3905#(and (<= 1 |check_#t~post3|) (<= (+ check_~y 1) check_~n))} ~x := 1 + #t~post3; {3906#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-11 00:54:40,084 INFO L280 TraceCheckUtils]: 62: Hoare triple {3906#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} havoc #t~post3; {3906#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-11 00:54:40,088 INFO L263 TraceCheckUtils]: 63: Hoare triple {3906#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call #t~ret5 := check(~x, ~y, ~a.base, ~a.offset, ~n); {3907#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} is VALID [2020-07-11 00:54:40,089 INFO L280 TraceCheckUtils]: 64: Hoare triple {3907#(and (<= 2 |check_#in~x|) (<= (+ |check_#in~y| 1) |check_#in~n|))} ~x := #in~x; {3908#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-11 00:54:40,090 INFO L280 TraceCheckUtils]: 65: Hoare triple {3908#(and (<= (+ |check_#in~y| 1) |check_#in~n|) (<= 2 check_~x))} ~y := #in~y; {3909#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-11 00:54:40,091 INFO L280 TraceCheckUtils]: 66: Hoare triple {3909#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {3909#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} is VALID [2020-07-11 00:54:40,092 INFO L280 TraceCheckUtils]: 67: Hoare triple {3909#(and (<= (+ check_~y 1) |check_#in~n|) (<= 2 check_~x))} ~n := #in~n; {3906#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-11 00:54:40,092 INFO L280 TraceCheckUtils]: 68: Hoare triple {3906#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} assume !(~x >= ~y); {3906#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} is VALID [2020-07-11 00:54:40,094 INFO L263 TraceCheckUtils]: 69: Hoare triple {3906#(and (<= (+ check_~y 1) check_~n) (<= 2 check_~x))} call __VERIFIER_assert((if 0 <= ~x && ~y < ~n then 1 else 0)); {3910#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 00:54:40,094 INFO L280 TraceCheckUtils]: 70: Hoare triple {3910#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3911#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 00:54:40,095 INFO L280 TraceCheckUtils]: 71: Hoare triple {3911#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3875#false} is VALID [2020-07-11 00:54:40,095 INFO L280 TraceCheckUtils]: 72: Hoare triple {3875#false} assume !false; {3875#false} is VALID [2020-07-11 00:54:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-11 00:54:40,104 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [73332264] [2020-07-11 00:54:40,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:54:40,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-11 00:54:40,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214540206] [2020-07-11 00:54:40,105 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2020-07-11 00:54:40,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:54:40,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-11 00:54:40,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:40,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-11 00:54:40,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:54:40,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-11 00:54:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-07-11 00:54:40,182 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 20 states. [2020-07-11 00:54:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:44,423 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2020-07-11 00:54:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-11 00:54:44,423 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2020-07-11 00:54:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:54:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:54:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 81 transitions. [2020-07-11 00:54:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 00:54:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 81 transitions. [2020-07-11 00:54:44,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 81 transitions. [2020-07-11 00:54:44,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:44,590 INFO L225 Difference]: With dead ends: 87 [2020-07-11 00:54:44,590 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:54:44,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=298, Invalid=1424, Unknown=0, NotChecked=0, Total=1722 [2020-07-11 00:54:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:54:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:54:44,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:54:44,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:54:44,593 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:54:44,593 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:54:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:44,593 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:54:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:54:44,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:44,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:44,594 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:54:44,594 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:54:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:54:44,594 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:54:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:54:44,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:44,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:54:44,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:54:44,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:54:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:54:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:54:44,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2020-07-11 00:54:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:54:44,596 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:54:44,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-11 00:54:44,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:54:44,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:54:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:54:44,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:54:44,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 00:54:44,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:54:45,621 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-07-11 00:54:45,984 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-07-11 00:54:46,335 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2020-07-11 00:54:46,460 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2020-07-11 00:54:46,621 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-07-11 00:54:46,750 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-07-11 00:54:46,899 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-11 00:54:47,078 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-11 00:54:47,239 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-11 00:54:47,768 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2020-07-11 00:54:47,969 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-07-11 00:54:48,147 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2020-07-11 00:54:48,321 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-07-11 00:54:48,561 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-11 00:54:48,687 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-07-11 00:54:48,803 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-07-11 00:54:48,960 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-11 00:54:49,082 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-07-11 00:54:49,232 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-07-11 00:54:49,409 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2020-07-11 00:54:49,564 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-11 00:54:49,683 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2020-07-11 00:54:49,850 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2020-07-11 00:54:50,008 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-07-11 00:54:50,191 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2020-07-11 00:54:50,460 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-07-11 00:54:50,653 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-07-11 00:54:50,660 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:54:50,660 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-11 00:54:50,660 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:54:50,660 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-11 00:54:50,660 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:54:50,661 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:54:50,661 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:54:50,661 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:54:50,661 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:54:50,662 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-07-11 00:54:50,662 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-11 00:54:50,662 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-11 00:54:50,662 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-07-11 00:54:50,662 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-07-11 00:54:50,663 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 39 48) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:54:50,663 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 39 48) the Hoare annotation is: true [2020-07-11 00:54:50,663 INFO L271 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: true [2020-07-11 00:54:50,663 INFO L271 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: true [2020-07-11 00:54:50,663 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 39 48) the Hoare annotation is: true [2020-07-11 00:54:50,663 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= .cse0 (select |#memory_int| |main_#t~malloc10.base|)) (= .cse0 (select |#memory_int| main_~a~0.base)))) [2020-07-11 00:54:50,663 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-11 00:54:50,663 INFO L271 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: true [2020-07-11 00:54:50,664 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:54:50,664 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc10.base|)) [2020-07-11 00:54:50,664 INFO L271 CegarLoopResult]: At program point L44-2(line 44) the Hoare annotation is: true [2020-07-11 00:54:50,664 INFO L264 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:54:50,664 INFO L271 CegarLoopResult]: At program point L44-3(line 44) the Hoare annotation is: true [2020-07-11 00:54:50,664 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:54:50,664 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2020-07-11 00:54:50,664 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 (or (= 0 check_~x) (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))))) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1) (not (<= 1 |check_#in~x|)) .cse3 .cse4)))) [2020-07-11 00:54:50,665 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ai~0)) (.cse1 (= 0 |check_#t~mem8|)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-11 00:54:50,665 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 37) the Hoare annotation is: true [2020-07-11 00:54:50,665 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:54:50,665 INFO L264 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse7 (select |#memory_int| |check_#in~a.base|)))) (.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= 0 |check_#t~mem8|)) (.cse3 (= .cse7 (select |#memory_int| check_~a.base)))) (and (or (and .cse0 .cse1 .cse2 .cse3) (not (<= 1 |check_#in~x|)) .cse4 .cse5) (or .cse4 .cse5 (not (= 0 |check_#in~x|)) (and .cse0 .cse1 .cse2 .cse3 (or (= 0 check_~x) (let ((.cse6 (+ check_~y 1))) (and (<= .cse6 |check_#in~n|) (<= .cse6 check_~n) (<= 1 check_~x))))))))) [2020-07-11 00:54:50,665 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:54:50,666 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-11 00:54:50,666 INFO L264 CegarLoopResult]: At program point L23-1(line 23) 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 (= 0 |check_#t~mem1|)) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (= 0 check_~x) .cse1 .cse2 .cse3) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse4 .cse5 (and .cse0 .cse1 .cse2 (<= 1 check_~x) .cse3)) (or .cse4 (not (<= 2 |check_#in~x|)) .cse5 (<= 2 check_~x))))) [2020-07-11 00:54:50,666 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-11 00:54:50,666 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse1 (<= .cse8 |check_#in~n|)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse8 check_~n)) (.cse4 (= 0 |check_#t~mem1|)) (.cse5 (= 0 |check_#t~mem2|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse6 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 (<= 1 check_~x) .cse3 .cse4 .cse5) .cse6) (or (and .cse1 (= 0 check_~x) .cse2 .cse3 .cse4 .cse5) .cse0 .cse6 (not (= 0 |check_#in~x|))) (or .cse0 (not (<= 2 |check_#in~x|)) .cse6 (<= 2 check_~x))))) [2020-07-11 00:54:50,667 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse1 (<= .cse8 |check_#in~n|)) (.cse2 (= .cse7 (select |#memory_int| check_~a.base))) (.cse3 (<= .cse8 check_~n)) (.cse4 (= 0 |check_#t~mem1|)) (.cse5 (= 0 |check_#t~mem2|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse6 (not (= .cse7 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 (<= 1 check_~x) .cse3 .cse4 .cse5) .cse6) (or (and .cse1 (= 0 check_~x) .cse2 .cse3 .cse4 .cse5) .cse0 .cse6 (not (= 0 |check_#in~x|))) (or .cse0 (not (<= 2 |check_#in~x|)) .cse6 (<= 2 check_~x))))) [2020-07-11 00:54:50,667 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-11 00:54:50,667 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-11 00:54:50,668 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (<= .cse6 |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse6 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (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 (and (= 0 |check_#t~post3|) .cse0 (= 0 check_~x) .cse1 .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or .cse3 (not (<= 2 |check_#in~x|)) .cse4 (<= 2 check_~x))))) [2020-07-11 00:54:50,668 INFO L264 CegarLoopResult]: At program point L23-7(line 23) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse0 (<= .cse6 |check_#in~n|)) (.cse1 (= .cse5 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse6 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 (<= 1 |check_#t~post3|) .cse2 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse3 .cse4) (or (and (= 0 |check_#t~post3|) .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:54:50,668 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-11 00:54:50,668 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse1 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse0 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse1 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) (and .cse0 (= .cse1 (select |#memory_int| check_~a.base)) .cse2 (<= 1 check_~x)) .cse3 .cse4) (or (and .cse0 (= 0 check_~x) .cse2) .cse3 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:54:50,669 INFO L264 CegarLoopResult]: At program point L23-9(line 23) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:54:50,669 INFO L264 CegarLoopResult]: At program point L23-10(line 23) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:54:50,669 INFO L264 CegarLoopResult]: At program point L23-11(lines 23 24) the Hoare annotation is: (let ((.cse5 (+ check_~y 1)) (.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|)))) (.cse0 (<= .cse5 |check_#in~n|)) (.cse1 (= .cse6 (select |#memory_int| check_~a.base))) (.cse2 (<= .cse5 check_~n))) (and (or (and .cse0 .cse1 .cse2 (<= 1 check_~x)) .cse3 .cse4 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse3 .cse4 (and .cse0 .cse1 .cse2 (<= 2 check_~x)))))) [2020-07-11 00:54:50,669 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-11 00:54:50,669 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (= 0 check_~ax~0)) (.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse4 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 .cse1 .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))))) .cse4 .cse5 (not (= 0 |check_#in~x|))) (or (and .cse0 .cse1 .cse2) (not (<= 1 |check_#in~x|)) .cse4 .cse5)))) [2020-07-11 00:54:50,670 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= 0 check_~ax~0) (= 0 check_~ai~0) (= .cse0 (select |#memory_int| check_~a.base))) (not (<= 1 |check_#in~x|)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-11 00:54:50,670 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (= 0 |check_#t~mem7|)) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (or (= 0 check_~x) (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x)))) .cse4)) (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse2 .cse4) .cse1)))) [2020-07-11 00:54:50,670 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= 0 check_~ai~0)) (.cse2 (= .cse6 (select |#memory_int| check_~a.base))) (.cse3 (= 0 |check_#t~mem7|)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= .cse6 (select |#memory_int| |check_#in~a.base|))))) (and (or (not (<= 1 |check_#in~x|)) .cse0 (and .cse1 .cse2 .cse3) .cse4) (or (and .cse1 .cse2 (or (= 0 check_~x) (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x)))) .cse3) .cse0 .cse4 (not (= 0 |check_#in~x|)))))) [2020-07-11 00:54:50,670 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:54:50,671 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:54:50,671 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:54:50,671 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:54:50,671 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:54:50,671 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:54:50,672 INFO L264 CegarLoopResult]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (= .cse4 (select |#memory_int| check_~a.base))) (.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (not (= .cse4 (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (or (= 0 check_~x) (let ((.cse1 (+ check_~y 1))) (and (<= .cse1 |check_#in~n|) (<= .cse1 check_~n) (<= 1 check_~x))))) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse2 .cse3)))) [2020-07-11 00:54:50,672 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:54:50,672 INFO L264 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse0 .cse1))) [2020-07-11 00:54:50,672 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= 1 |check_#in~x|)) (= .cse0 (select |#memory_int| check_~a.base)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (= .cse0 (select |#memory_int| |check_#in~a.base|))))) [2020-07-11 00:54:50,672 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-11 00:54:50,673 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (= .cse5 (select |#memory_int| check_~a.base))) (.cse4 (<= .cse6 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= .cse5 (select |#memory_int| |check_#in~a.base|))))) (and (or .cse0 .cse1 (not (= 0 |check_#in~x|)) (and .cse2 (= 0 check_~x) .cse3 .cse4)) (or (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x))))) [2020-07-11 00:54:50,673 INFO L264 CegarLoopResult]: At program point L14(lines 14 37) 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 (= 0 check_~x) .cse0 .cse1 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) (<= 1 check_~x) .cse0 .cse1) (or .cse0 (not (<= 2 |check_#in~x|)) .cse1 (<= 2 check_~x)))) [2020-07-11 00:54:50,673 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 37) the Hoare annotation is: (let ((.cse0 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (= ((as const (Array Int Int)) 0) (select |#memory_int| |check_#in~a.base|))))) (and (or (and .cse0 (= 0 check_~x)) .cse1 .cse2 (not (= 0 |check_#in~x|))) (or (and .cse0 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse1 (not (<= 2 |check_#in~x|)) .cse2 (<= 2 check_~x)))) [2020-07-11 00:54:50,673 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 37) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (= .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 (= 0 check_~x) .cse1) .cse2 .cse3 (not (= 0 |check_#in~x|))) (or (not (<= 1 |check_#in~x|)) .cse2 (and .cse0 .cse1 (<= 1 check_~x)) .cse3) (or .cse2 (not (<= 2 |check_#in~x|)) .cse3 (<= 2 check_~x))))) [2020-07-11 00:54:50,673 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-07-11 00:54:50,673 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 00:54:50,674 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 00:54:50,674 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 00:54:50,674 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 00:54:50,674 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 00:54:50,674 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-11 00:54:50,674 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-11 00:54:50,674 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-07-11 00:54:50,750 INFO L163 areAnnotationChecker]: CFG has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:54:50,760 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-11 00:54:50,769 INFO L168 Benchmark]: Toolchain (without parser) took 32874.93 ms. Allocated memory was 143.1 MB in the beginning and 463.5 MB in the end (delta: 320.3 MB). Free memory was 100.1 MB in the beginning and 430.8 MB in the end (delta: -330.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:54:50,775 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:54:50,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.68 ms. Allocated memory is still 143.1 MB. Free memory was 99.7 MB in the beginning and 88.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:54:50,777 INFO L168 Benchmark]: Boogie Preprocessor took 140.28 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 88.7 MB in the beginning and 178.5 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:54:50,777 INFO L168 Benchmark]: RCFGBuilder took 634.02 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 144.9 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:54:50,778 INFO L168 Benchmark]: TraceAbstraction took 31749.78 ms. Allocated memory was 201.3 MB in the beginning and 463.5 MB in the end (delta: 262.1 MB). Free memory was 144.2 MB in the beginning and 430.8 MB in the end (delta: -286.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 00:54:50,786 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.27 ms. Allocated memory is still 143.1 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.68 ms. Allocated memory is still 143.1 MB. Free memory was 99.7 MB in the beginning and 88.7 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.28 ms. Allocated memory was 143.1 MB in the beginning and 201.3 MB in the end (delta: 58.2 MB). Free memory was 88.7 MB in the beginning and 178.5 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 634.02 ms. Allocated memory is still 201.3 MB. Free memory was 178.5 MB in the beginning and 144.9 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31749.78 ms. Allocated memory was 201.3 MB in the beginning and 463.5 MB in the end (delta: 262.1 MB). Free memory was 144.2 MB in the beginning and 430.8 MB in the end (delta: -286.6 MB). There was no memory consumed. 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: 39]: 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...