/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-267fbe0 [2020-07-18 04:59:38,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:59:38,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:59:38,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:59:38,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:59:38,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:59:38,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:59:38,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:59:38,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:59:38,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:59:38,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:59:38,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:59:38,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:59:38,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:59:38,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:59:38,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:59:38,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:59:38,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:59:38,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:59:38,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:59:38,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:59:38,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:59:38,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:59:38,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:59:38,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:59:38,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:59:38,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:59:38,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:59:38,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:59:38,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:59:38,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:59:38,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:59:38,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:59:38,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:59:38,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:59:38,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:59:38,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:59:38,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:59:38,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:59:38,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:59:38,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:59:38,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:59:38,858 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:59:38,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:59:38,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:59:38,860 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:59:38,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:59:38,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:59:38,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:59:38,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:59:38,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:59:38,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:59:38,861 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:59:38,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:59:38,861 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:59:38,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:59:38,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:59:38,862 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:59:38,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:59:38,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:59:38,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:59:38,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:59:38,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:59:38,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:59:38,863 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 04:59:39,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:59:39,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:59:39,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:59:39,193 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:59:39,194 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:59:39,195 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-18 04:59:39,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebfcb9c2/0ce38b28a6994d62a3bf79cea61ae888/FLAGf0afc4491 [2020-07-18 04:59:39,761 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:59:39,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_2x3-2.c [2020-07-18 04:59:39,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebfcb9c2/0ce38b28a6994d62a3bf79cea61ae888/FLAGf0afc4491 [2020-07-18 04:59:40,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebfcb9c2/0ce38b28a6994d62a3bf79cea61ae888 [2020-07-18 04:59:40,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:59:40,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:59:40,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:59:40,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:59:40,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:59:40,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2a1c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40, skipping insertion in model container [2020-07-18 04:59:40,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:59:40,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:59:40,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:59:40,370 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:59:40,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:59:40,402 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:59:40,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40 WrapperNode [2020-07-18 04:59:40,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:59:40,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:59:40,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:59:40,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:59:40,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (1/1) ... [2020-07-18 04:59:40,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:59:40,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:59:40,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:59:40,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:59:40,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:59:40,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:59:40,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:59:40,596 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-18 04:59:40,596 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:59:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:59:40,596 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-18 04:59:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:59:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:59:40,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:59:40,888 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:59:40,889 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:59:40,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:59:40 BoogieIcfgContainer [2020-07-18 04:59:40,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:59:40,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:59:40,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:59:40,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:59:40,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:59:40" (1/3) ... [2020-07-18 04:59:40,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241ad0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:59:40, skipping insertion in model container [2020-07-18 04:59:40,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:59:40" (2/3) ... [2020-07-18 04:59:40,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241ad0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:59:40, skipping insertion in model container [2020-07-18 04:59:40,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:59:40" (3/3) ... [2020-07-18 04:59:40,915 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-2.c [2020-07-18 04:59:40,926 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:59:40,934 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:59:40,948 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:59:40,974 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:59:40,974 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:59:40,975 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:59:40,975 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:59:40,975 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:59:40,975 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:59:40,975 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:59:40,975 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:59:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-18 04:59:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 04:59:41,005 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:59:41,007 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-18 04:59:41,008 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:59:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:59:41,016 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-18 04:59:41,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:59:41,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1420786403] [2020-07-18 04:59:41,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:59:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:41,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-18 04:59:41,245 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-18 04:59:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:41,312 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:41,314 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-18 04:59:41,316 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:41,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#(<= |sum_#in~n| 0)} #res := ~m + ~n; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:41,319 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#(<= |sum_#in~n| 0)} assume true; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:41,322 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-18 04:59:41,324 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-18 04:59:41,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-18 04:59:41,325 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-18 04:59:41,326 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-18 04:59:41,328 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} ~a~0 := 2; {34#(<= 2 main_~a~0)} is VALID [2020-07-18 04:59:41,329 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= 2 main_~a~0)} ~b~0 := 3; {34#(<= 2 main_~a~0)} is VALID [2020-07-18 04:59:41,330 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-18 04:59:41,331 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:41,332 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-18 04:59:41,334 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:41,336 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#(<= |sum_#in~n| 0)} #res := ~m + ~n; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:41,337 INFO L280 TraceCheckUtils]: 11: Hoare triple {42#(<= |sum_#in~n| 0)} assume true; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:41,340 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-18 04:59:41,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {31#false} is VALID [2020-07-18 04:59:41,341 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} ~result~0 := #t~ret1; {31#false} is VALID [2020-07-18 04:59:41,342 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} havoc #t~ret1; {31#false} is VALID [2020-07-18 04:59:41,342 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume ~result~0 != ~a~0 + ~b~0; {31#false} is VALID [2020-07-18 04:59:41,343 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-18 04:59:41,346 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-18 04:59:41,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1420786403] [2020-07-18 04:59:41,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:59:41,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:59:41,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251325990] [2020-07-18 04:59:41,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:59:41,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:59:41,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:59:41,415 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-18 04:59:41,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:59:41,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:59:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:59:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:59:41,430 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-18 04:59:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:41,751 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-18 04:59:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:59:41,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:59:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:59:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:59:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-18 04:59:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:59:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-18 04:59:41,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-18 04:59:41,850 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-18 04:59:41,864 INFO L225 Difference]: With dead ends: 39 [2020-07-18 04:59:41,865 INFO L226 Difference]: Without dead ends: 25 [2020-07-18 04:59:41,870 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:59:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-18 04:59:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-18 04:59:41,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:59:41,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:41,978 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:41,979 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:41,985 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-18 04:59:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-18 04:59:41,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:41,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:41,987 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:41,987 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-18 04:59:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:41,992 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-18 04:59:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-18 04:59:41,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:41,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:41,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:59:41,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:59:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 04:59:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-18 04:59:42,000 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-18 04:59:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:59:42,014 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-18 04:59:42,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:59:42,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-18 04:59:42,061 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-18 04:59:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-18 04:59:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-18 04:59:42,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:59:42,063 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-18 04:59:42,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:59:42,064 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:59:42,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:59:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-18 04:59:42,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:59:42,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1047196631] [2020-07-18 04:59:42,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:59:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:42,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-18 04:59:42,119 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-18 04:59:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:42,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,215 INFO L280 TraceCheckUtils]: 3: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,216 INFO L280 TraceCheckUtils]: 4: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,221 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {253#(<= |sum_#in~n| 0)} {245#(= sum_~n |sum_#in~n|)} #37#return; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,225 INFO L263 TraceCheckUtils]: 3: Hoare triple {245#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {225#true} is VALID [2020-07-18 04:59:42,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,227 INFO L280 TraceCheckUtils]: 5: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,228 INFO L280 TraceCheckUtils]: 6: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,229 INFO L280 TraceCheckUtils]: 7: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,232 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {253#(<= |sum_#in~n| 0)} {245#(= sum_~n |sum_#in~n|)} #37#return; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,233 INFO L280 TraceCheckUtils]: 10: Hoare triple {252#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,234 INFO L280 TraceCheckUtils]: 11: Hoare triple {252#(<= |sum_#in~n| 1)} #res := #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,236 INFO L280 TraceCheckUtils]: 12: Hoare triple {252#(<= |sum_#in~n| 1)} havoc #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,237 INFO L280 TraceCheckUtils]: 13: Hoare triple {252#(<= |sum_#in~n| 1)} assume true; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,239 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {252#(<= |sum_#in~n| 1)} {229#(<= 2 main_~a~0)} #39#return; {226#false} is VALID [2020-07-18 04:59:42,240 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-18 04:59:42,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-18 04:59:42,241 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-18 04:59:42,241 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret2 := main(); {225#true} is VALID [2020-07-18 04:59:42,247 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~a~0 := 2; {229#(<= 2 main_~a~0)} is VALID [2020-07-18 04:59:42,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(<= 2 main_~a~0)} ~b~0 := 3; {229#(<= 2 main_~a~0)} is VALID [2020-07-18 04:59:42,249 INFO L263 TraceCheckUtils]: 6: Hoare triple {229#(<= 2 main_~a~0)} call #t~ret1 := sum(~a~0, ~b~0); {225#true} is VALID [2020-07-18 04:59:42,250 INFO L280 TraceCheckUtils]: 7: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,252 INFO L280 TraceCheckUtils]: 8: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,253 INFO L280 TraceCheckUtils]: 9: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,254 INFO L263 TraceCheckUtils]: 10: Hoare triple {245#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {225#true} is VALID [2020-07-18 04:59:42,255 INFO L280 TraceCheckUtils]: 11: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,256 INFO L280 TraceCheckUtils]: 12: Hoare triple {245#(= sum_~n |sum_#in~n|)} ~m := #in~m; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:42,259 INFO L280 TraceCheckUtils]: 13: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,261 INFO L280 TraceCheckUtils]: 14: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,262 INFO L280 TraceCheckUtils]: 15: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-18 04:59:42,265 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {253#(<= |sum_#in~n| 0)} {245#(= sum_~n |sum_#in~n|)} #37#return; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,266 INFO L280 TraceCheckUtils]: 17: Hoare triple {252#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,267 INFO L280 TraceCheckUtils]: 18: Hoare triple {252#(<= |sum_#in~n| 1)} #res := #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,268 INFO L280 TraceCheckUtils]: 19: Hoare triple {252#(<= |sum_#in~n| 1)} havoc #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,269 INFO L280 TraceCheckUtils]: 20: Hoare triple {252#(<= |sum_#in~n| 1)} assume true; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-18 04:59:42,271 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {252#(<= |sum_#in~n| 1)} {229#(<= 2 main_~a~0)} #39#return; {226#false} is VALID [2020-07-18 04:59:42,271 INFO L280 TraceCheckUtils]: 22: Hoare triple {226#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {226#false} is VALID [2020-07-18 04:59:42,271 INFO L280 TraceCheckUtils]: 23: Hoare triple {226#false} ~result~0 := #t~ret1; {226#false} is VALID [2020-07-18 04:59:42,272 INFO L280 TraceCheckUtils]: 24: Hoare triple {226#false} havoc #t~ret1; {226#false} is VALID [2020-07-18 04:59:42,272 INFO L280 TraceCheckUtils]: 25: Hoare triple {226#false} assume ~result~0 != ~a~0 + ~b~0; {226#false} is VALID [2020-07-18 04:59:42,272 INFO L280 TraceCheckUtils]: 26: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-18 04:59:42,279 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-18 04:59:42,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1047196631] [2020-07-18 04:59:42,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:59:42,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-18 04:59:42,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235826214] [2020-07-18 04:59:42,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-18 04:59:42,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:59:42,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 04:59:42,320 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-18 04:59:42,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 04:59:42,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:59:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 04:59:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 04:59:42,322 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-07-18 04:59:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:42,563 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-18 04:59:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:59:42,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-18 04:59:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:59:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:59:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-18 04:59:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 04:59:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-18 04:59:42,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-18 04:59:42,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:59:42,631 INFO L225 Difference]: With dead ends: 36 [2020-07-18 04:59:42,632 INFO L226 Difference]: Without dead ends: 30 [2020-07-18 04:59:42,633 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-18 04:59:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-18 04:59:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-18 04:59:42,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:59:42,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:42,692 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:42,693 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:42,697 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-18 04:59:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-18 04:59:42,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:42,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:42,698 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:42,698 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-18 04:59:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:42,702 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-18 04:59:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-18 04:59:42,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:42,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:42,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:59:42,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:59:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-18 04:59:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-18 04:59:42,707 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-07-18 04:59:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:59:42,707 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-18 04:59:42,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 04:59:42,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2020-07-18 04:59:42,752 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-18 04:59:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-18 04:59:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 04:59:42,754 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:59:42,755 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-18 04:59:42,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:59:42,755 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:59:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:59:42,756 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-07-18 04:59:42,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:59:42,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1903711309] [2020-07-18 04:59:42,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:59:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:42,927 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} assume true; {452#true} is VALID [2020-07-18 04:59:42,927 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {452#true} {452#true} #33#return; {452#true} is VALID [2020-07-18 04:59:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:59:43,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0; {511#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-18 04:59:43,270 INFO L280 TraceCheckUtils]: 3: Hoare triple {511#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-18 04:59:43,271 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-18 04:59:43,273 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #37#return; {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-18 04:59:43,277 INFO L263 TraceCheckUtils]: 3: Hoare triple {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {452#true} is VALID [2020-07-18 04:59:43,278 INFO L280 TraceCheckUtils]: 4: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,279 INFO L280 TraceCheckUtils]: 5: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,285 INFO L280 TraceCheckUtils]: 6: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0; {511#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-18 04:59:43,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {511#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-18 04:59:43,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-18 04:59:43,289 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #37#return; {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,290 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,292 INFO L280 TraceCheckUtils]: 11: Hoare triple {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,293 INFO L280 TraceCheckUtils]: 12: Hoare triple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} havoc #t~ret0; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,294 INFO L280 TraceCheckUtils]: 13: Hoare triple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,296 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #37#return; {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,298 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,299 INFO L280 TraceCheckUtils]: 1: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,301 INFO L263 TraceCheckUtils]: 3: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} call #t~ret0 := sum(~n - 1, 1 + ~m); {452#true} is VALID [2020-07-18 04:59:43,301 INFO L280 TraceCheckUtils]: 4: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,302 INFO L280 TraceCheckUtils]: 5: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,303 INFO L280 TraceCheckUtils]: 6: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-18 04:59:43,304 INFO L263 TraceCheckUtils]: 7: Hoare triple {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {452#true} is VALID [2020-07-18 04:59:43,305 INFO L280 TraceCheckUtils]: 8: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,306 INFO L280 TraceCheckUtils]: 9: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0; {511#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-18 04:59:43,308 INFO L280 TraceCheckUtils]: 11: Hoare triple {511#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-18 04:59:43,309 INFO L280 TraceCheckUtils]: 12: Hoare triple {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-18 04:59:43,311 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #37#return; {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,312 INFO L280 TraceCheckUtils]: 14: Hoare triple {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,313 INFO L280 TraceCheckUtils]: 15: Hoare triple {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,314 INFO L280 TraceCheckUtils]: 16: Hoare triple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} havoc #t~ret0; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,315 INFO L280 TraceCheckUtils]: 17: Hoare triple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,317 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #37#return; {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,319 INFO L280 TraceCheckUtils]: 19: Hoare triple {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,320 INFO L280 TraceCheckUtils]: 20: Hoare triple {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-18 04:59:43,321 INFO L280 TraceCheckUtils]: 21: Hoare triple {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} havoc #t~ret0; {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-18 04:59:43,322 INFO L280 TraceCheckUtils]: 22: Hoare triple {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} assume true; {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-18 04:59:43,324 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} {456#(<= main_~a~0 2)} #39#return; {481#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 04:59:43,326 INFO L263 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2020-07-18 04:59:43,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {452#true} assume true; {452#true} is VALID [2020-07-18 04:59:43,327 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {452#true} {452#true} #33#return; {452#true} is VALID [2020-07-18 04:59:43,327 INFO L263 TraceCheckUtils]: 3: Hoare triple {452#true} call #t~ret2 := main(); {452#true} is VALID [2020-07-18 04:59:43,328 INFO L280 TraceCheckUtils]: 4: Hoare triple {452#true} ~a~0 := 2; {456#(<= main_~a~0 2)} is VALID [2020-07-18 04:59:43,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {456#(<= main_~a~0 2)} ~b~0 := 3; {456#(<= main_~a~0 2)} is VALID [2020-07-18 04:59:43,334 INFO L263 TraceCheckUtils]: 6: Hoare triple {456#(<= main_~a~0 2)} call #t~ret1 := sum(~a~0, ~b~0); {452#true} is VALID [2020-07-18 04:59:43,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,335 INFO L280 TraceCheckUtils]: 8: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,336 INFO L263 TraceCheckUtils]: 10: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} call #t~ret0 := sum(~n - 1, 1 + ~m); {452#true} is VALID [2020-07-18 04:59:43,336 INFO L280 TraceCheckUtils]: 11: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,337 INFO L280 TraceCheckUtils]: 12: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,337 INFO L280 TraceCheckUtils]: 13: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume !(~n <= 0); {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} is VALID [2020-07-18 04:59:43,338 INFO L263 TraceCheckUtils]: 14: Hoare triple {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} call #t~ret0 := sum(~n - 1, 1 + ~m); {452#true} is VALID [2020-07-18 04:59:43,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-18 04:59:43,339 INFO L280 TraceCheckUtils]: 16: Hoare triple {483#(= sum_~n |sum_#in~n|)} ~m := #in~m; {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} is VALID [2020-07-18 04:59:43,341 INFO L280 TraceCheckUtils]: 17: Hoare triple {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} assume ~n <= 0; {511#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} is VALID [2020-07-18 04:59:43,343 INFO L280 TraceCheckUtils]: 18: Hoare triple {511#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= sum_~n 0))} #res := ~m + ~n; {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-18 04:59:43,344 INFO L280 TraceCheckUtils]: 19: Hoare triple {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} assume true; {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} is VALID [2020-07-18 04:59:43,346 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {512#(and (<= (+ |sum_#in~n| |sum_#in~m|) |sum_#res|) (<= |sum_#res| |sum_#in~m|))} {502#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|) (<= 1 sum_~n))} #37#return; {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,347 INFO L280 TraceCheckUtils]: 21: Hoare triple {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,348 INFO L280 TraceCheckUtils]: 22: Hoare triple {509#(and (<= (+ |sum_#in~m| 1) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,349 INFO L280 TraceCheckUtils]: 23: Hoare triple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} havoc #t~ret0; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,350 INFO L280 TraceCheckUtils]: 24: Hoare triple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} assume true; {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,353 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {510#(and (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)))} {484#(and (= sum_~m |sum_#in~m|) (= sum_~n |sum_#in~n|))} #37#return; {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,354 INFO L280 TraceCheckUtils]: 26: Hoare triple {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} is VALID [2020-07-18 04:59:43,355 INFO L280 TraceCheckUtils]: 27: Hoare triple {500#(and (<= (+ |sum_#in~m| 2) |sum_#t~ret0|) (<= |sum_#t~ret0| (+ |sum_#in~n| |sum_#in~m|)))} #res := #t~ret0; {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-18 04:59:43,356 INFO L280 TraceCheckUtils]: 28: Hoare triple {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} havoc #t~ret0; {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-18 04:59:43,357 INFO L280 TraceCheckUtils]: 29: Hoare triple {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} assume true; {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} is VALID [2020-07-18 04:59:43,359 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {501#(and (<= |sum_#res| (+ |sum_#in~n| |sum_#in~m|)) (<= (+ |sum_#in~m| 2) |sum_#res|))} {456#(<= main_~a~0 2)} #39#return; {481#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 04:59:43,360 INFO L280 TraceCheckUtils]: 31: Hoare triple {481#(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; {481#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} is VALID [2020-07-18 04:59:43,361 INFO L280 TraceCheckUtils]: 32: Hoare triple {481#(and (<= (+ main_~a~0 main_~b~0) |main_#t~ret1|) (<= |main_#t~ret1| (+ main_~a~0 main_~b~0)))} ~result~0 := #t~ret1; {482#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} is VALID [2020-07-18 04:59:43,362 INFO L280 TraceCheckUtils]: 33: Hoare triple {482#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} havoc #t~ret1; {482#(and (<= main_~result~0 (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) main_~result~0))} is VALID [2020-07-18 04:59:43,363 INFO L280 TraceCheckUtils]: 34: Hoare triple {482#(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; {453#false} is VALID [2020-07-18 04:59:43,363 INFO L280 TraceCheckUtils]: 35: Hoare triple {453#false} assume !false; {453#false} is VALID [2020-07-18 04:59:43,367 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-18 04:59:43,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1903711309] [2020-07-18 04:59:43,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:59:43,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-18 04:59:43,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873569523] [2020-07-18 04:59:43,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-18 04:59:43,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:59:43,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 04:59:43,419 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-18 04:59:43,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 04:59:43,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:59:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 04:59:43,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-18 04:59:43,421 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2020-07-18 04:59:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:44,472 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-18 04:59:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-18 04:59:44,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-18 04:59:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:59:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 04:59:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-07-18 04:59:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 04:59:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-07-18 04:59:44,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2020-07-18 04:59:44,541 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-18 04:59:44,541 INFO L225 Difference]: With dead ends: 30 [2020-07-18 04:59:44,541 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 04:59:44,543 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-18 04:59:44,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 04:59:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 04:59:44,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:59:44,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 04:59:44,544 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:59:44,544 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:59:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:44,544 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:59:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:59:44,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:44,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:44,545 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:59:44,546 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:59:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:59:44,546 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:59:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:59:44,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:44,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:59:44,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:59:44,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:59:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 04:59:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 04:59:44,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-18 04:59:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:59:44,548 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 04:59:44,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 04:59:44,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 04:59:44,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:59:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:59:44,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:59:44,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:59:44,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 04:59:45,141 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2020-07-18 04:59:45,304 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2020-07-18 04:59:45,429 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2020-07-18 04:59:45,469 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:59:45,469 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:59:45,469 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:59:45,469 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 04:59:45,469 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 04:59:45,469 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:59:45,470 INFO L264 CegarLoopResult]: At program point sumEXIT(lines 3 9) the Hoare annotation is: (and (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (+ |sum_#in~n| |sum_#in~m|))) (or (and .cse0 (<= .cse1 |sum_#res|) (<= |sum_#res| |sum_#in~m|)) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| .cse1)))) (let ((.cse2 (= sum_~n |sum_#in~n|))) (or (and (<= |sum_#in~n| 1) .cse2) (and .cse2 (<= (+ |sum_#in~m| 2) |sum_#res|))))) [2020-07-18 04:59:45,470 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-18 04:59:45,470 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-18 04:59:45,470 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_#in~n| 0)) [2020-07-18 04:59:45,470 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-18 04:59:45,471 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-18 04:59:45,471 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-18 04:59:45,471 INFO L264 CegarLoopResult]: At program point L3(lines 3 9) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-07-18 04:59:45,472 INFO L264 CegarLoopResult]: At program point sumFINAL(lines 3 9) the Hoare annotation is: (and (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (+ |sum_#in~n| |sum_#in~m|))) (or (and .cse0 (<= .cse1 |sum_#res|) (<= |sum_#res| |sum_#in~m|)) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#res|) (<= |sum_#res| .cse1)))) (let ((.cse2 (= sum_~n |sum_#in~n|))) (or (and (<= |sum_#in~n| 1) .cse2) (and .cse2 (<= (+ |sum_#in~m| 2) |sum_#res|))))) [2020-07-18 04:59:45,472 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-07-18 04:59:45,472 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: false [2020-07-18 04:59:45,472 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-18 04:59:45,472 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: (<= 2 main_~a~0) [2020-07-18 04:59:45,473 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: false [2020-07-18 04:59:45,473 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-18 04:59:45,473 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= 2 main_~a~0) (<= main_~a~0 2)) [2020-07-18 04:59:45,473 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 main_~a~0) (<= main_~a~0 2)) [2020-07-18 04:59:45,473 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-18 04:59:45,473 INFO L264 CegarLoopResult]: At program point L15-2(lines 11 18) the Hoare annotation is: (<= 2 main_~a~0) [2020-07-18 04:59:45,474 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-18 04:59:45,474 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-18 04:59:45,503 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-18 04:59:45,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:59:45 BoogieIcfgContainer [2020-07-18 04:59:45,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:59:45,522 INFO L168 Benchmark]: Toolchain (without parser) took 5369.30 ms. Allocated memory was 145.8 MB in the beginning and 274.2 MB in the end (delta: 128.5 MB). Free memory was 104.2 MB in the beginning and 185.1 MB in the end (delta: -80.9 MB). Peak memory consumption was 47.6 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:45,523 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 04:59:45,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.37 ms. Allocated memory is still 145.8 MB. Free memory was 103.8 MB in the beginning and 94.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:45,525 INFO L168 Benchmark]: Boogie Preprocessor took 30.66 ms. Allocated memory is still 145.8 MB. Free memory was 94.4 MB in the beginning and 93.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:45,526 INFO L168 Benchmark]: RCFGBuilder took 459.77 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 93.0 MB in the beginning and 166.7 MB in the end (delta: -73.7 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:45,527 INFO L168 Benchmark]: TraceAbstraction took 4623.29 ms. Allocated memory was 202.9 MB in the beginning and 274.2 MB in the end (delta: 71.3 MB). Free memory was 166.0 MB in the beginning and 185.1 MB in the end (delta: -19.1 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2020-07-18 04:59:45,531 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.97 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.37 ms. Allocated memory is still 145.8 MB. Free memory was 103.8 MB in the beginning and 94.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.66 ms. Allocated memory is still 145.8 MB. Free memory was 94.4 MB in the beginning and 93.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 459.77 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 93.0 MB in the beginning and 166.7 MB in the end (delta: -73.7 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4623.29 ms. Allocated memory was 202.9 MB in the beginning and 274.2 MB in the end (delta: 71.3 MB). Free memory was 166.0 MB in the beginning and 185.1 MB in the end (delta: -19.1 MB). Peak memory consumption was 52.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: (((m == \old(m) && \old(n) + \old(m) <= \result) && \result <= \old(m)) || ((m == \old(m) && \old(m) + 1 <= \result) && \result <= \old(n) + \old(m))) && ((\old(n) <= 1 && n == \old(n)) || (n == \old(n) && \old(m) + 2 <= \result)) - 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.5s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 55 SDtfs, 60 SDslu, 181 SDs, 0 SdLazy, 193 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 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, 336 HoareAnnotationTreeSize, 37 FomulaSimplifications, 160 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 27 FomulaSimplificationsInter, 205 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 10488 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...