/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/recursive-simple/sum_2x3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:09:03,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:09:03,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:09:03,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:09:03,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:09:03,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:09:03,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:09:03,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:09:03,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:09:03,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:09:03,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:09:03,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:09:03,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:09:03,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:09:03,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:09:03,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:09:03,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:09:03,692 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:09:03,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:09:03,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:09:03,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:09:03,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:09:03,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:09:03,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:09:03,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:09:03,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:09:03,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:09:03,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:09:03,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:09:03,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:09:03,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:09:03,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:09:03,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:09:03,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:09:03,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:09:03,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:09:03,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:09:03,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:09:03,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:09:03,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:09:03,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:09:03,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:09:03,726 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:09:03,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:09:03,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:09:03,728 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:09:03,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:09:03,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:09:03,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:09:03,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:09:03,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:09:03,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:09:03,729 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:09:03,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:09:03,730 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:09:03,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:09:03,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:09:03,730 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:09:03,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:09:03,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:09:03,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:09:03,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:09:03,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:09:03,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:09:03,732 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-08 22:09:04,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:09:04,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:09:04,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:09:04,047 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:09:04,047 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:09:04,048 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_2x3-2.c [2020-07-08 22:09:04,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e837d90/aba1c72cae9a4b9eae6dba468b688f39/FLAG83d29eefd [2020-07-08 22:09:04,657 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:09:04,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_2x3-2.c [2020-07-08 22:09:04,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e837d90/aba1c72cae9a4b9eae6dba468b688f39/FLAG83d29eefd [2020-07-08 22:09:05,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8e837d90/aba1c72cae9a4b9eae6dba468b688f39 [2020-07-08 22:09:05,018 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:09:05,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:09:05,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:09:05,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:09:05,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:09:05,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d2d94b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05, skipping insertion in model container [2020-07-08 22:09:05,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:09:05,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:09:05,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:09:05,234 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:09:05,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:09:05,267 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:09:05,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05 WrapperNode [2020-07-08 22:09:05,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:09:05,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:09:05,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:09:05,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:09:05,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (1/1) ... [2020-07-08 22:09:05,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:09:05,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:09:05,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:09:05,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:09:05,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (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-08 22:09:05,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:09:05,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:09:05,457 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-08 22:09:05,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:09:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:09:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-08 22:09:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:09:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:09:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:09:05,769 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:09:05,769 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:09:05,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:09:05 BoogieIcfgContainer [2020-07-08 22:09:05,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:09:05,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:09:05,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:09:05,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:09:05,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:09:05" (1/3) ... [2020-07-08 22:09:05,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740794cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:09:05, skipping insertion in model container [2020-07-08 22:09:05,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:09:05" (2/3) ... [2020-07-08 22:09:05,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740794cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:09:05, skipping insertion in model container [2020-07-08 22:09:05,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:09:05" (3/3) ... [2020-07-08 22:09:05,781 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-2.c [2020-07-08 22:09:05,791 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:09:05,797 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:09:05,812 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:09:05,833 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:09:05,834 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:09:05,834 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:09:05,834 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:09:05,834 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:09:05,834 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:09:05,834 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:09:05,835 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:09:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-08 22:09:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 22:09:05,861 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:09:05,862 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:09:05,862 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:09:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:09:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-08 22:09:05,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:09:05,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774689352] [2020-07-08 22:09:05,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:09:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:06,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-08 22:09:06,087 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-08 22:09:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:06,172 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:06,174 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#(= sum_~n |sum_#in~n|)} ~m := #in~m; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:06,175 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:06,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {43#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:06,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#(<= |sum_#in~n| 0)} assume true; {43#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:06,181 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {43#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-08 22:09:06,182 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-08 22:09:06,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-08 22:09:06,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-08 22:09:06,184 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-08 22:09:06,185 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} ~a~0 := 2; {34#(<= 2 main_~a~0)} is VALID [2020-07-08 22:09:06,187 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= 2 main_~a~0)} ~b~0 := 3; {34#(<= 2 main_~a~0)} is VALID [2020-07-08 22:09:06,187 INFO L263 TraceCheckUtils]: 6: Hoare triple {34#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {30#true} is VALID [2020-07-08 22:09:06,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:06,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#(= sum_~n |sum_#in~n|)} ~m := #in~m; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:06,191 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:06,193 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {43#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:06,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#(<= |sum_#in~n| 0)} assume true; {43#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:06,196 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {43#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-08 22:09:06,197 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {31#false} is VALID [2020-07-08 22:09:06,197 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} ~result~0 := #t~ret1; {31#false} is VALID [2020-07-08 22:09:06,198 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} havoc #t~ret1; {31#false} is VALID [2020-07-08 22:09:06,198 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume ~result~0 != ~a~0 + ~b~0; {31#false} is VALID [2020-07-08 22:09:06,199 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-08 22:09:06,202 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-08 22:09:06,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774689352] [2020-07-08 22:09:06,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:09:06,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 22:09:06,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169228235] [2020-07-08 22:09:06,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 22:09:06,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:09:06,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 22:09:06,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:09:06,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 22:09:06,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:09:06,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 22:09:06,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:09:06,299 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 6 states. [2020-07-08 22:09:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:06,595 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-08 22:09:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 22:09:06,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-08 22:09:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:09:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:09:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-08 22:09:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:09:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-08 22:09:06,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-08 22:09:06,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:09:06,707 INFO L225 Difference]: With dead ends: 39 [2020-07-08 22:09:06,707 INFO L226 Difference]: Without dead ends: 25 [2020-07-08 22:09:06,712 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:09:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-08 22:09:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-08 22:09:06,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:09:06,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-08 22:09:06,796 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 22:09:06,797 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 22:09:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:06,803 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-08 22:09:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 22:09:06,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:09:06,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:09:06,805 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 22:09:06,805 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 22:09:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:06,810 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-08 22:09:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 22:09:06,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:09:06,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:09:06,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:09:06,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:09:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 22:09:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-08 22:09:06,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-08 22:09:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:09:06,818 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-08 22:09:06,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 22:09:06,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-08 22:09:06,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:09:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 22:09:06,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 22:09:06,873 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:09:06,873 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:09:06,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:09:06,876 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:09:06,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:09:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-08 22:09:06,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:09:06,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1044795515] [2020-07-08 22:09:06,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:09:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:06,942 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-08 22:09:06,943 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {224#true} {224#true} #33#return; {224#true} is VALID [2020-07-08 22:09:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:07,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} ~n := #in~n; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#(= sum_~n |sum_#in~n|)} ~m := #in~m; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {244#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {252#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:07,080 INFO L280 TraceCheckUtils]: 3: Hoare triple {252#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:07,081 INFO L280 TraceCheckUtils]: 4: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:07,083 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {253#(<= |sum_#in~n| 0)} {244#(= sum_~n |sum_#in~n|)} #37#return; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,084 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} ~n := #in~n; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#(= sum_~n |sum_#in~n|)} ~m := #in~m; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {244#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,086 INFO L263 TraceCheckUtils]: 3: Hoare triple {244#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {224#true} is VALID [2020-07-08 22:09:07,087 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} ~n := #in~n; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,088 INFO L280 TraceCheckUtils]: 5: Hoare triple {244#(= sum_~n |sum_#in~n|)} ~m := #in~m; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,088 INFO L280 TraceCheckUtils]: 6: Hoare triple {244#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {252#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:07,090 INFO L280 TraceCheckUtils]: 7: Hoare triple {252#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:07,090 INFO L280 TraceCheckUtils]: 8: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:07,092 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {253#(<= |sum_#in~n| 0)} {244#(= sum_~n |sum_#in~n|)} #37#return; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,093 INFO L280 TraceCheckUtils]: 10: Hoare triple {251#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,094 INFO L280 TraceCheckUtils]: 11: Hoare triple {251#(<= |sum_#in~n| 1)} #res := #t~ret0; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,095 INFO L280 TraceCheckUtils]: 12: Hoare triple {251#(<= |sum_#in~n| 1)} havoc #t~ret0; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,095 INFO L280 TraceCheckUtils]: 13: Hoare triple {251#(<= |sum_#in~n| 1)} assume true; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,097 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {251#(<= |sum_#in~n| 1)} {228#(<= 2 main_~a~0)} #39#return; {225#false} is VALID [2020-07-08 22:09:07,099 INFO L263 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2020-07-08 22:09:07,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-08 22:09:07,099 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #33#return; {224#true} is VALID [2020-07-08 22:09:07,100 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#true} call #t~ret2 := main(); {224#true} is VALID [2020-07-08 22:09:07,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} ~a~0 := 2; {228#(<= 2 main_~a~0)} is VALID [2020-07-08 22:09:07,101 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#(<= 2 main_~a~0)} ~b~0 := 3; {228#(<= 2 main_~a~0)} is VALID [2020-07-08 22:09:07,102 INFO L263 TraceCheckUtils]: 6: Hoare triple {228#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {224#true} is VALID [2020-07-08 22:09:07,102 INFO L280 TraceCheckUtils]: 7: Hoare triple {224#true} ~n := #in~n; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,103 INFO L280 TraceCheckUtils]: 8: Hoare triple {244#(= sum_~n |sum_#in~n|)} ~m := #in~m; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,104 INFO L280 TraceCheckUtils]: 9: Hoare triple {244#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,105 INFO L263 TraceCheckUtils]: 10: Hoare triple {244#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {224#true} is VALID [2020-07-08 22:09:07,105 INFO L280 TraceCheckUtils]: 11: Hoare triple {224#true} ~n := #in~n; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,106 INFO L280 TraceCheckUtils]: 12: Hoare triple {244#(= sum_~n |sum_#in~n|)} ~m := #in~m; {244#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:07,107 INFO L280 TraceCheckUtils]: 13: Hoare triple {244#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {252#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:07,108 INFO L280 TraceCheckUtils]: 14: Hoare triple {252#(and (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:07,109 INFO L280 TraceCheckUtils]: 15: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-08 22:09:07,111 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {253#(<= |sum_#in~n| 0)} {244#(= sum_~n |sum_#in~n|)} #37#return; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,112 INFO L280 TraceCheckUtils]: 17: Hoare triple {251#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,112 INFO L280 TraceCheckUtils]: 18: Hoare triple {251#(<= |sum_#in~n| 1)} #res := #t~ret0; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,113 INFO L280 TraceCheckUtils]: 19: Hoare triple {251#(<= |sum_#in~n| 1)} havoc #t~ret0; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,114 INFO L280 TraceCheckUtils]: 20: Hoare triple {251#(<= |sum_#in~n| 1)} assume true; {251#(<= |sum_#in~n| 1)} is VALID [2020-07-08 22:09:07,116 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {251#(<= |sum_#in~n| 1)} {228#(<= 2 main_~a~0)} #39#return; {225#false} is VALID [2020-07-08 22:09:07,116 INFO L280 TraceCheckUtils]: 22: Hoare triple {225#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {225#false} is VALID [2020-07-08 22:09:07,116 INFO L280 TraceCheckUtils]: 23: Hoare triple {225#false} ~result~0 := #t~ret1; {225#false} is VALID [2020-07-08 22:09:07,117 INFO L280 TraceCheckUtils]: 24: Hoare triple {225#false} havoc #t~ret1; {225#false} is VALID [2020-07-08 22:09:07,117 INFO L280 TraceCheckUtils]: 25: Hoare triple {225#false} assume ~result~0 != ~a~0 + ~b~0; {225#false} is VALID [2020-07-08 22:09:07,117 INFO L280 TraceCheckUtils]: 26: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-08 22:09:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-08 22:09:07,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1044795515] [2020-07-08 22:09:07,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:09:07,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 22:09:07,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984007024] [2020-07-08 22:09:07,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-08 22:09:07,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:09:07,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 22:09:07,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:09:07,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 22:09:07,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:09:07,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 22:09:07,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 22:09:07,159 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2020-07-08 22:09:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:07,342 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-08 22:09:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 22:09:07,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-08 22:09:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:09:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:09:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-08 22:09:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 22:09:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-08 22:09:07,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-08 22:09:07,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:09:07,403 INFO L225 Difference]: With dead ends: 36 [2020-07-08 22:09:07,403 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 22:09:07,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:09:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 22:09:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 22:09:07,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:09:07,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 22:09:07,444 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 22:09:07,444 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 22:09:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:07,448 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 22:09:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 22:09:07,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:09:07,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:09:07,449 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 22:09:07,449 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 22:09:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:07,453 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 22:09:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 22:09:07,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:09:07,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:09:07,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:09:07,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:09:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 22:09:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-08 22:09:07,458 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-07-08 22:09:07,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:09:07,458 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-08 22:09:07,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 22:09:07,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2020-07-08 22:09:07,500 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-08 22:09:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-08 22:09:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-08 22:09:07,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:09:07,502 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:09:07,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:09:07,503 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:09:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:09:07,503 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-07-08 22:09:07,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:09:07,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [934372279] [2020-07-08 22:09:07,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:09:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:07,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {450#true} assume true; {450#true} is VALID [2020-07-08 22:09:07,645 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {450#true} {450#true} #33#return; {450#true} is VALID [2020-07-08 22:09:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:09:08,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0; {509#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:08,051 INFO L280 TraceCheckUtils]: 3: Hoare triple {509#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-08 22:09:08,052 INFO L280 TraceCheckUtils]: 4: Hoare triple {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-08 22:09:08,055 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #37#return; {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,058 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-08 22:09:08,059 INFO L263 TraceCheckUtils]: 3: Hoare triple {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {450#true} is VALID [2020-07-08 22:09:08,060 INFO L280 TraceCheckUtils]: 4: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,061 INFO L280 TraceCheckUtils]: 5: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,061 INFO L280 TraceCheckUtils]: 6: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0; {509#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:08,063 INFO L280 TraceCheckUtils]: 7: Hoare triple {509#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-08 22:09:08,064 INFO L280 TraceCheckUtils]: 8: Hoare triple {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-08 22:09:08,067 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #37#return; {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,069 INFO L280 TraceCheckUtils]: 10: Hoare triple {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,071 INFO L280 TraceCheckUtils]: 12: Hoare triple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} havoc #t~ret0; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,073 INFO L280 TraceCheckUtils]: 13: Hoare triple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,075 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #37#return; {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,084 INFO L263 TraceCheckUtils]: 3: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} call #t~ret0 := sum(~n - 1, 1 + ~m); {450#true} is VALID [2020-07-08 22:09:08,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-08 22:09:08,087 INFO L263 TraceCheckUtils]: 7: Hoare triple {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {450#true} is VALID [2020-07-08 22:09:08,088 INFO L280 TraceCheckUtils]: 8: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,089 INFO L280 TraceCheckUtils]: 9: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0; {509#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:08,091 INFO L280 TraceCheckUtils]: 11: Hoare triple {509#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-08 22:09:08,092 INFO L280 TraceCheckUtils]: 12: Hoare triple {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-08 22:09:08,095 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #37#return; {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,096 INFO L280 TraceCheckUtils]: 14: Hoare triple {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,098 INFO L280 TraceCheckUtils]: 15: Hoare triple {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,099 INFO L280 TraceCheckUtils]: 16: Hoare triple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} havoc #t~ret0; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,101 INFO L280 TraceCheckUtils]: 17: Hoare triple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,103 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #37#return; {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,105 INFO L280 TraceCheckUtils]: 19: Hoare triple {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,106 INFO L280 TraceCheckUtils]: 20: Hoare triple {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-08 22:09:08,107 INFO L280 TraceCheckUtils]: 21: Hoare triple {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} havoc #t~ret0; {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-08 22:09:08,108 INFO L280 TraceCheckUtils]: 22: Hoare triple {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} assume true; {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-08 22:09:08,110 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} {454#(<= main_~a~0 2)} #39#return; {479#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 22:09:08,112 INFO L263 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2020-07-08 22:09:08,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {450#true} assume true; {450#true} is VALID [2020-07-08 22:09:08,113 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {450#true} {450#true} #33#return; {450#true} is VALID [2020-07-08 22:09:08,113 INFO L263 TraceCheckUtils]: 3: Hoare triple {450#true} call #t~ret2 := main(); {450#true} is VALID [2020-07-08 22:09:08,114 INFO L280 TraceCheckUtils]: 4: Hoare triple {450#true} ~a~0 := 2; {454#(<= main_~a~0 2)} is VALID [2020-07-08 22:09:08,115 INFO L280 TraceCheckUtils]: 5: Hoare triple {454#(<= main_~a~0 2)} ~b~0 := 3; {454#(<= main_~a~0 2)} is VALID [2020-07-08 22:09:08,115 INFO L263 TraceCheckUtils]: 6: Hoare triple {454#(<= main_~a~0 2)} call #t~ret1 := sum(~a~0, ~b~0); {450#true} is VALID [2020-07-08 22:09:08,116 INFO L280 TraceCheckUtils]: 7: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,116 INFO L280 TraceCheckUtils]: 8: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,117 INFO L280 TraceCheckUtils]: 9: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,117 INFO L263 TraceCheckUtils]: 10: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} call #t~ret0 := sum(~n - 1, 1 + ~m); {450#true} is VALID [2020-07-08 22:09:08,118 INFO L280 TraceCheckUtils]: 11: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,119 INFO L280 TraceCheckUtils]: 12: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,120 INFO L280 TraceCheckUtils]: 13: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-08 22:09:08,121 INFO L263 TraceCheckUtils]: 14: Hoare triple {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {450#true} is VALID [2020-07-08 22:09:08,121 INFO L280 TraceCheckUtils]: 15: Hoare triple {450#true} ~n := #in~n; {481#(= sum_~n |sum_#in~n|)} is VALID [2020-07-08 22:09:08,123 INFO L280 TraceCheckUtils]: 16: Hoare triple {481#(= sum_~n |sum_#in~n|)} ~m := #in~m; {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-08 22:09:08,124 INFO L280 TraceCheckUtils]: 17: Hoare triple {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0; {509#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-08 22:09:08,125 INFO L280 TraceCheckUtils]: 18: Hoare triple {509#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-08 22:09:08,127 INFO L280 TraceCheckUtils]: 19: Hoare triple {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-08 22:09:08,129 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {510#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {500#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #37#return; {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,131 INFO L280 TraceCheckUtils]: 21: Hoare triple {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,132 INFO L280 TraceCheckUtils]: 22: Hoare triple {507#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,133 INFO L280 TraceCheckUtils]: 23: Hoare triple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} havoc #t~ret0; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,134 INFO L280 TraceCheckUtils]: 24: Hoare triple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,136 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {508#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {482#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #37#return; {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,138 INFO L280 TraceCheckUtils]: 26: Hoare triple {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-08 22:09:08,139 INFO L280 TraceCheckUtils]: 27: Hoare triple {498#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-08 22:09:08,140 INFO L280 TraceCheckUtils]: 28: Hoare triple {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} havoc #t~ret0; {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-08 22:09:08,141 INFO L280 TraceCheckUtils]: 29: Hoare triple {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} assume true; {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-08 22:09:08,143 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {499#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} {454#(<= main_~a~0 2)} #39#return; {479#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 22:09:08,145 INFO L280 TraceCheckUtils]: 31: Hoare triple {479#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {479#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} is VALID [2020-07-08 22:09:08,146 INFO L280 TraceCheckUtils]: 32: Hoare triple {479#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} ~result~0 := #t~ret1; {480#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} is VALID [2020-07-08 22:09:08,147 INFO L280 TraceCheckUtils]: 33: Hoare triple {480#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} havoc #t~ret1; {480#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} is VALID [2020-07-08 22:09:08,148 INFO L280 TraceCheckUtils]: 34: Hoare triple {480#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} assume ~result~0 != ~a~0 + ~b~0; {451#false} is VALID [2020-07-08 22:09:08,148 INFO L280 TraceCheckUtils]: 35: Hoare triple {451#false} assume !false; {451#false} is VALID [2020-07-08 22:09:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-08 22:09:08,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [934372279] [2020-07-08 22:09:08,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:09:08,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-08 22:09:08,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132709340] [2020-07-08 22:09:08,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-08 22:09:08,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:09:08,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 22:09:08,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:09:08,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 22:09:08,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:09:08,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 22:09:08,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-08 22:09:08,205 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2020-07-08 22:09:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:09,257 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-08 22:09:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-08 22:09:09,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-08 22:09:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:09:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 22:09:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-07-08 22:09:09,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 22:09:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-07-08 22:09:09,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2020-07-08 22:09:09,300 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-08 22:09:09,300 INFO L225 Difference]: With dead ends: 30 [2020-07-08 22:09:09,301 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 22:09:09,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2020-07-08 22:09:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 22:09:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 22:09:09,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:09:09,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 22:09:09,303 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:09:09,303 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:09:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:09,303 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:09:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:09:09,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:09:09,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:09:09,304 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:09:09,304 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:09:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:09:09,305 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:09:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:09:09,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:09:09,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:09:09,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:09:09,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:09:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 22:09:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 22:09:09,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-08 22:09:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:09:09,306 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 22:09:09,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 22:09:09,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 22:09:09,307 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-08 22:09:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:09:09,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:09:09,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:09:09,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 22:09:09,800 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2020-07-08 22:09:10,026 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:09:10,026 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:09:10,026 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:09:10,026 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:09:10,026 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 22:09:10,026 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:09:10,027 INFO L264 CegarLoopResult]: At program point sumEXIT(lines 3 9) the Hoare annotation is: (let ((.cse3 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse2 (<= |sum_#res| .cse3)) (.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (= sum_~n |sum_#in~n|))) (or (and (<= |sum_#in~n| 1) .cse0 .cse1 (<= (+ |sum_#in~m| 1) |sum_#res|) .cse2) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#res|)) (and .cse0 .cse1 (<= .cse3 |sum_#res|) (<= |sum_#res| |sum_#in~m|))))) [2020-07-08 22:09:10,027 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n)) [2020-07-08 22:09:10,027 INFO L264 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (= sum_~m |sum_#in~m|) (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and (<= |sum_#in~n| 1) .cse0) (and .cse0 (<= (+ |sum_#in~m| 2) |sum_#t~ret0|)))) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|))) [2020-07-08 22:09:10,027 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0)) [2020-07-08 22:09:10,028 INFO L264 CegarLoopResult]: At program point L7-2(line 7) the Hoare annotation is: (and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (= sum_~m |sum_#in~m|) (let ((.cse0 (= sum_~n |sum_#in~n|))) (or (and (<= |sum_#in~n| 1) .cse0) (and .cse0 (<= (+ |sum_#in~m| 2) |sum_#t~ret0|)))) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|))) [2020-07-08 22:09:10,028 INFO L264 CegarLoopResult]: At program point L4(lines 4 8) the Hoare annotation is: (and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|)) [2020-07-08 22:09:10,028 INFO L264 CegarLoopResult]: At program point L7-3(line 7) the Hoare annotation is: (let ((.cse0 (+ |sum_#in~m| 1)) (.cse1 (+ |sum_#in~n| |sum_#in~m|))) (and (<= .cse0 |sum_#t~ret0|) (= sum_~m |sum_#in~m|) (<= .cse0 |sum_#res|) (<= |sum_#res| .cse1) (let ((.cse2 (= sum_~n |sum_#in~n|))) (or (and (<= |sum_#in~n| 1) .cse2) (let ((.cse3 (+ |sum_#in~m| 2))) (and .cse2 (<= .cse3 |sum_#t~ret0|) (<= .cse3 |sum_#res|))))) (<= |sum_#t~ret0| .cse1))) [2020-07-08 22:09:10,028 INFO L264 CegarLoopResult]: At program point L3(lines 3 9) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-07-08 22:09:10,029 INFO L264 CegarLoopResult]: At program point sumFINAL(lines 3 9) the Hoare annotation is: (let ((.cse3 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse2 (<= |sum_#res| .cse3)) (.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (= sum_~n |sum_#in~n|))) (or (and (<= |sum_#in~n| 1) .cse0 .cse1 (<= (+ |sum_#in~m| 1) |sum_#res|) .cse2) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#res|)) (and .cse0 .cse1 (<= .cse3 |sum_#res|) (<= |sum_#res| |sum_#in~m|))))) [2020-07-08 22:09:10,029 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-07-08 22:09:10,029 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: false [2020-07-08 22:09:10,029 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-08 22:09:10,029 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: (<= 2 main_~a~0) [2020-07-08 22:09:10,030 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: false [2020-07-08 22:09:10,030 INFO L264 CegarLoopResult]: At program point L15(lines 15 17) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= 2 main_~a~0) (<= main_~result~0 .cse0) (<= .cse0 main_~result~0) (<= main_~a~0 2))) [2020-07-08 22:09:10,030 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= 2 main_~a~0) (<= main_~a~0 2)) [2020-07-08 22:09:10,030 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 main_~a~0) (<= main_~a~0 2)) [2020-07-08 22:09:10,030 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= 2 main_~a~0) (<= .cse0 |main_#t~ret1|) (<= main_~a~0 2) (<= |main_#t~ret1| .cse0))) [2020-07-08 22:09:10,030 INFO L264 CegarLoopResult]: At program point L15-2(lines 11 18) the Hoare annotation is: (<= 2 main_~a~0) [2020-07-08 22:09:10,030 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= 2 main_~a~0) (<= .cse0 |main_#t~ret1|) (<= main_~a~0 2) (<= |main_#t~ret1| .cse0))) [2020-07-08 22:09:10,031 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= 2 main_~a~0) (<= .cse0 |main_#t~ret1|) (<= main_~result~0 .cse0) (<= .cse0 main_~result~0) (<= main_~a~0 2) (<= |main_#t~ret1| .cse0))) [2020-07-08 22:09:10,053 INFO L163 areAnnotationChecker]: CFG has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:09:10,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:09:10 BoogieIcfgContainer [2020-07-08 22:09:10,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:09:10,071 INFO L168 Benchmark]: Toolchain (without parser) took 5050.84 ms. Allocated memory was 134.2 MB in the beginning and 256.9 MB in the end (delta: 122.7 MB). Free memory was 99.6 MB in the beginning and 86.2 MB in the end (delta: 13.4 MB). Peak memory consumption was 136.1 MB. Max. memory is 7.1 GB. [2020-07-08 22:09:10,071 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory is still 117.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 22:09:10,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.33 ms. Allocated memory is still 134.2 MB. Free memory was 99.2 MB in the beginning and 89.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:09:10,073 INFO L168 Benchmark]: Boogie Preprocessor took 30.36 ms. Allocated memory is still 134.2 MB. Free memory was 89.6 MB in the beginning and 88.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:09:10,074 INFO L168 Benchmark]: RCFGBuilder took 473.67 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 88.3 MB in the beginning and 162.4 MB in the end (delta: -74.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-08 22:09:10,075 INFO L168 Benchmark]: TraceAbstraction took 4293.70 ms. Allocated memory was 199.2 MB in the beginning and 256.9 MB in the end (delta: 57.7 MB). Free memory was 161.4 MB in the beginning and 87.8 MB in the end (delta: 73.6 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. [2020-07-08 22:09:10,079 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.20 ms. Allocated memory is still 134.2 MB. Free memory is still 117.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.33 ms. Allocated memory is still 134.2 MB. Free memory was 99.2 MB in the beginning and 89.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.36 ms. Allocated memory is still 134.2 MB. Free memory was 89.6 MB in the beginning and 88.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 473.67 ms. Allocated memory was 134.2 MB in the beginning and 199.2 MB in the end (delta: 65.0 MB). Free memory was 88.3 MB in the beginning and 162.4 MB in the end (delta: -74.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4293.70 ms. Allocated memory was 199.2 MB in the beginning and 256.9 MB in the end (delta: 57.7 MB). Free memory was 161.4 MB in the beginning and 87.8 MB in the end (delta: 73.6 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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: 3]: Procedure Contract for sum Derived contract for procedure sum: (((((\old(n) <= 1 && m == \old(m)) && n == \old(n)) && \old(m) + 1 <= \result) && \result <= \old(n) + \old(m)) || (((m == \old(m) && n == \old(n)) && \result <= \old(n) + \old(m)) && \old(m) + 2 <= \result)) || (((m == \old(m) && n == \old(n)) && \old(n) + \old(m) <= \result) && \result <= \old(m)) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 2 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.4s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 55 SDtfs, 64 SDslu, 190 SDs, 0 SdLazy, 197 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 37 PreInvPairs, 67 NumberOfFragments, 352 HoareAnnotationTreeSize, 37 FomulaSimplifications, 157 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 27 FomulaSimplificationsInter, 186 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 10660 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...