/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-8fc6572 [2020-07-11 00:53:42,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:53:42,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:53:42,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:53:42,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:53:42,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:53:42,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:53:42,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:53:42,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:53:42,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:53:42,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:53:42,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:53:42,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:53:42,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:53:42,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:53:42,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:53:42,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:53:42,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:53:42,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:53:42,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:53:42,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:53:42,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:53:42,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:53:42,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:53:42,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:53:42,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:53:42,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:53:42,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:53:42,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:53:42,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:53:42,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:53:42,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:53:42,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:53:42,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:53:42,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:53:42,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:53:42,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:53:42,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:53:42,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:53:42,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:53:42,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:53:42,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-11 00:53:42,742 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:53:42,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:53:42,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:53:42,743 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:53:42,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:53:42,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:53:42,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:53:42,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:53:42,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:53:42,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:53:42,745 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:53:42,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:53:42,745 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:53:42,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:53:42,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:53:42,746 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:53:42,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:53:42,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:53:42,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:53:42,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:53:42,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:53:42,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:53:42,747 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:53:43,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:53:43,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:53:43,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:53:43,040 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:53:43,040 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:53:43,041 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-11 00:53:43,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382104b58/d1d38cfb58724a46bacbe79db3dda33e/FLAGa3d7986b9 [2020-07-11 00:53:43,566 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:53:43,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_2x3-2.c [2020-07-11 00:53:43,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382104b58/d1d38cfb58724a46bacbe79db3dda33e/FLAGa3d7986b9 [2020-07-11 00:53:43,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382104b58/d1d38cfb58724a46bacbe79db3dda33e [2020-07-11 00:53:43,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:53:43,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:53:43,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:53:43,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:53:43,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:53:43,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:53:43" (1/1) ... [2020-07-11 00:53:43,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74465d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:43, skipping insertion in model container [2020-07-11 00:53:43,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:53:43" (1/1) ... [2020-07-11 00:53:43,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:53:43,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:53:44,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:53:44,142 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:53:44,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:53:44,174 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:53:44,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44 WrapperNode [2020-07-11 00:53:44,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:53:44,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:53:44,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:53:44,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:53:44,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (1/1) ... [2020-07-11 00:53:44,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (1/1) ... [2020-07-11 00:53:44,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (1/1) ... [2020-07-11 00:53:44,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (1/1) ... [2020-07-11 00:53:44,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (1/1) ... [2020-07-11 00:53:44,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (1/1) ... [2020-07-11 00:53:44,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (1/1) ... [2020-07-11 00:53:44,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:53:44,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:53:44,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:53:44,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:53:44,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:53:44,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:53:44,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:53:44,357 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-11 00:53:44,357 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:53:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:53:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-11 00:53:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:53:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:53:44,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:53:44,591 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:53:44,591 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:53:44,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:53:44 BoogieIcfgContainer [2020-07-11 00:53:44,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:53:44,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:53:44,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:53:44,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:53:44,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:53:43" (1/3) ... [2020-07-11 00:53:44,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249bb69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:53:44, skipping insertion in model container [2020-07-11 00:53:44,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:53:44" (2/3) ... [2020-07-11 00:53:44,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249bb69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:53:44, skipping insertion in model container [2020-07-11 00:53:44,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:53:44" (3/3) ... [2020-07-11 00:53:44,609 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-2.c [2020-07-11 00:53:44,624 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:53:44,633 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:53:44,650 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:53:44,672 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:53:44,673 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:53:44,673 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:53:44,673 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:53:44,673 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:53:44,674 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:53:44,674 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:53:44,674 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:53:44,690 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-11 00:53:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-11 00:53:44,711 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:53:44,712 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-11 00:53:44,715 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:53:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:53:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-07-11 00:53:44,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:53:44,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877433569] [2020-07-11 00:53:44,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:53:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:44,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-11 00:53:44,938 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-11 00:53:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:45,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:45,006 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-11 00:53:45,007 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,008 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#(<= |sum_#in~n| 0)} #res := ~m + ~n; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,017 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#(<= |sum_#in~n| 0)} assume true; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,020 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-11 00:53:45,021 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-11 00:53:45,021 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-11 00:53:45,022 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #33#return; {30#true} is VALID [2020-07-11 00:53:45,022 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-11 00:53:45,023 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} ~a~0 := 2; {34#(<= 2 main_~a~0)} is VALID [2020-07-11 00:53:45,024 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(<= 2 main_~a~0)} ~b~0 := 3; {34#(<= 2 main_~a~0)} is VALID [2020-07-11 00:53:45,025 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-11 00:53:45,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~n := #in~n; {41#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:45,026 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-11 00:53:45,029 INFO L280 TraceCheckUtils]: 9: Hoare triple {41#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,031 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#(<= |sum_#in~n| 0)} #res := ~m + ~n; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,033 INFO L280 TraceCheckUtils]: 11: Hoare triple {42#(<= |sum_#in~n| 0)} assume true; {42#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,036 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {42#(<= |sum_#in~n| 0)} {34#(<= 2 main_~a~0)} #39#return; {31#false} is VALID [2020-07-11 00:53:45,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {31#false} is VALID [2020-07-11 00:53:45,037 INFO L280 TraceCheckUtils]: 14: Hoare triple {31#false} ~result~0 := #t~ret1; {31#false} is VALID [2020-07-11 00:53:45,037 INFO L280 TraceCheckUtils]: 15: Hoare triple {31#false} havoc #t~ret1; {31#false} is VALID [2020-07-11 00:53:45,038 INFO L280 TraceCheckUtils]: 16: Hoare triple {31#false} assume ~result~0 != ~a~0 + ~b~0; {31#false} is VALID [2020-07-11 00:53:45,038 INFO L280 TraceCheckUtils]: 17: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-11 00:53:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 00:53:45,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877433569] [2020-07-11 00:53:45,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:53:45,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:53:45,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233524396] [2020-07-11 00:53:45,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:53:45,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:53:45,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:53:45,115 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-11 00:53:45,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:53:45,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:53:45,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:53:45,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:53:45,129 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-07-11 00:53:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:45,402 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-07-11 00:53:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 00:53:45,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 00:53:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:53:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:53:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-11 00:53:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:53:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-11 00:53:45,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2020-07-11 00:53:45,492 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-11 00:53:45,505 INFO L225 Difference]: With dead ends: 39 [2020-07-11 00:53:45,505 INFO L226 Difference]: Without dead ends: 25 [2020-07-11 00:53:45,510 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-11 00:53:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-11 00:53:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-11 00:53:45,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:53:45,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-11 00:53:45,590 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-11 00:53:45,591 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-11 00:53:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:45,598 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-11 00:53:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-11 00:53:45,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:45,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:53:45,600 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-11 00:53:45,600 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-11 00:53:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:45,605 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-11 00:53:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-11 00:53:45,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:45,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:53:45,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:53:45,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:53:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-11 00:53:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-11 00:53:45,629 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-07-11 00:53:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:53:45,629 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-11 00:53:45,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:53:45,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2020-07-11 00:53:45,682 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-11 00:53:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-11 00:53:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 00:53:45,684 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:53:45,684 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-11 00:53:45,685 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:53:45,686 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:53:45,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:53:45,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-07-11 00:53:45,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:53:45,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [477750323] [2020-07-11 00:53:45,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:53:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:45,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-11 00:53:45,767 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-11 00:53:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:45,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:45,857 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-11 00:53:45,858 INFO L280 TraceCheckUtils]: 2: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,859 INFO L280 TraceCheckUtils]: 3: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,859 INFO L280 TraceCheckUtils]: 4: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,862 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-11 00:53:45,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:45,863 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-11 00:53:45,864 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-11 00:53:45,864 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-11 00:53:45,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:45,872 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-11 00:53:45,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,874 INFO L280 TraceCheckUtils]: 7: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,877 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-11 00:53:45,879 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-11 00:53:45,880 INFO L280 TraceCheckUtils]: 11: Hoare triple {252#(<= |sum_#in~n| 1)} #res := #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-11 00:53:45,881 INFO L280 TraceCheckUtils]: 12: Hoare triple {252#(<= |sum_#in~n| 1)} havoc #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-11 00:53:45,883 INFO L280 TraceCheckUtils]: 13: Hoare triple {252#(<= |sum_#in~n| 1)} assume true; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-11 00:53:45,884 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {252#(<= |sum_#in~n| 1)} {229#(<= 2 main_~a~0)} #39#return; {226#false} is VALID [2020-07-11 00:53:45,886 INFO L263 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2020-07-11 00:53:45,886 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#true} assume true; {225#true} is VALID [2020-07-11 00:53:45,886 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {225#true} {225#true} #33#return; {225#true} is VALID [2020-07-11 00:53:45,887 INFO L263 TraceCheckUtils]: 3: Hoare triple {225#true} call #t~ret2 := main(); {225#true} is VALID [2020-07-11 00:53:45,888 INFO L280 TraceCheckUtils]: 4: Hoare triple {225#true} ~a~0 := 2; {229#(<= 2 main_~a~0)} is VALID [2020-07-11 00:53:45,889 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(<= 2 main_~a~0)} ~b~0 := 3; {229#(<= 2 main_~a~0)} is VALID [2020-07-11 00:53:45,889 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-11 00:53:45,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:45,891 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-11 00:53:45,892 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-11 00:53:45,893 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-11 00:53:45,893 INFO L280 TraceCheckUtils]: 11: Hoare triple {225#true} ~n := #in~n; {245#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:45,894 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-11 00:53:45,895 INFO L280 TraceCheckUtils]: 13: Hoare triple {245#(= sum_~n |sum_#in~n|)} assume ~n <= 0; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {253#(<= |sum_#in~n| 0)} #res := ~m + ~n; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,898 INFO L280 TraceCheckUtils]: 15: Hoare triple {253#(<= |sum_#in~n| 0)} assume true; {253#(<= |sum_#in~n| 0)} is VALID [2020-07-11 00:53:45,900 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-11 00:53:45,902 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-11 00:53:45,904 INFO L280 TraceCheckUtils]: 18: Hoare triple {252#(<= |sum_#in~n| 1)} #res := #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-11 00:53:45,905 INFO L280 TraceCheckUtils]: 19: Hoare triple {252#(<= |sum_#in~n| 1)} havoc #t~ret0; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-11 00:53:45,906 INFO L280 TraceCheckUtils]: 20: Hoare triple {252#(<= |sum_#in~n| 1)} assume true; {252#(<= |sum_#in~n| 1)} is VALID [2020-07-11 00:53:45,908 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {252#(<= |sum_#in~n| 1)} {229#(<= 2 main_~a~0)} #39#return; {226#false} is VALID [2020-07-11 00:53:45,908 INFO L280 TraceCheckUtils]: 22: Hoare triple {226#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {226#false} is VALID [2020-07-11 00:53:45,908 INFO L280 TraceCheckUtils]: 23: Hoare triple {226#false} ~result~0 := #t~ret1; {226#false} is VALID [2020-07-11 00:53:45,909 INFO L280 TraceCheckUtils]: 24: Hoare triple {226#false} havoc #t~ret1; {226#false} is VALID [2020-07-11 00:53:45,909 INFO L280 TraceCheckUtils]: 25: Hoare triple {226#false} assume ~result~0 != ~a~0 + ~b~0; {226#false} is VALID [2020-07-11 00:53:45,909 INFO L280 TraceCheckUtils]: 26: Hoare triple {226#false} assume !false; {226#false} is VALID [2020-07-11 00:53:45,911 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-11 00:53:45,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [477750323] [2020-07-11 00:53:45,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:53:45,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-11 00:53:45,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993997612] [2020-07-11 00:53:45,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-11 00:53:45,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:53:45,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 00:53:45,946 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-11 00:53:45,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 00:53:45,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:53:45,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 00:53:45,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:53:45,947 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-07-11 00:53:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:46,142 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-07-11 00:53:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:53:46,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-11 00:53:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:53:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:53:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-11 00:53:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 00:53:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-11 00:53:46,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-11 00:53:46,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:53:46,202 INFO L225 Difference]: With dead ends: 36 [2020-07-11 00:53:46,202 INFO L226 Difference]: Without dead ends: 30 [2020-07-11 00:53:46,204 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-11 00:53:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-11 00:53:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-11 00:53:46,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:53:46,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-11 00:53:46,248 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-11 00:53:46,248 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-11 00:53:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:46,251 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-11 00:53:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-11 00:53:46,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:46,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:53:46,253 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-11 00:53:46,253 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-11 00:53:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:46,257 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-11 00:53:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-11 00:53:46,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:46,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:53:46,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:53:46,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:53:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-11 00:53:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-07-11 00:53:46,262 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-07-11 00:53:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:53:46,262 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-07-11 00:53:46,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 00:53:46,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2020-07-11 00:53:46,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:53:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-07-11 00:53:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-11 00:53:46,306 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:53:46,306 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-11 00:53:46,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:53:46,307 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:53:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:53:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-07-11 00:53:46,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:53:46,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181864683] [2020-07-11 00:53:46,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:53:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:46,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} assume true; {452#true} is VALID [2020-07-11 00:53:46,444 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {452#true} {452#true} #33#return; {452#true} is VALID [2020-07-11 00:53:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:53:46,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,837 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-11 00:53:46,838 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-11 00:53:46,839 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-11 00:53:46,840 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-11 00:53:46,846 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-11 00:53:46,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,850 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-11 00:53:46,851 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-11 00:53:46,852 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-11 00:53:46,853 INFO L280 TraceCheckUtils]: 4: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,855 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-11 00:53:46,861 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-11 00:53:46,862 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-11 00:53:46,863 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-11 00:53:46,865 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-11 00:53:46,869 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-11 00:53:46,874 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-11 00:53:46,875 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-11 00:53:46,876 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-11 00:53:46,878 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-11 00:53:46,881 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,881 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-11 00:53:46,882 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-11 00:53:46,883 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-11 00:53:46,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,890 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-11 00:53:46,892 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-11 00:53:46,893 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-11 00:53:46,894 INFO L280 TraceCheckUtils]: 8: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,895 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-11 00:53:46,896 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-11 00:53:46,897 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-11 00:53:46,898 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-11 00:53:46,901 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-11 00:53:46,903 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-11 00:53:46,904 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-11 00:53:46,905 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-11 00:53:46,906 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-11 00:53:46,908 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-11 00:53:46,910 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-11 00:53:46,911 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-11 00:53:46,912 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-11 00:53:46,924 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-11 00:53:46,926 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-11 00:53:46,929 INFO L263 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2020-07-11 00:53:46,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {452#true} assume true; {452#true} is VALID [2020-07-11 00:53:46,930 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {452#true} {452#true} #33#return; {452#true} is VALID [2020-07-11 00:53:46,930 INFO L263 TraceCheckUtils]: 3: Hoare triple {452#true} call #t~ret2 := main(); {452#true} is VALID [2020-07-11 00:53:46,933 INFO L280 TraceCheckUtils]: 4: Hoare triple {452#true} ~a~0 := 2; {456#(<= main_~a~0 2)} is VALID [2020-07-11 00:53:46,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {456#(<= main_~a~0 2)} ~b~0 := 3; {456#(<= main_~a~0 2)} is VALID [2020-07-11 00:53:46,934 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-11 00:53:46,935 INFO L280 TraceCheckUtils]: 7: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,936 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-11 00:53:46,937 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-11 00:53:46,937 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-11 00:53:46,938 INFO L280 TraceCheckUtils]: 11: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,939 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-11 00:53:46,940 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-11 00:53:46,940 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-11 00:53:46,941 INFO L280 TraceCheckUtils]: 15: Hoare triple {452#true} ~n := #in~n; {483#(= sum_~n |sum_#in~n|)} is VALID [2020-07-11 00:53:46,942 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-11 00:53:46,943 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-11 00:53:46,944 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-11 00:53:46,945 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-11 00:53:46,947 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-11 00:53:46,948 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-11 00:53:46,949 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-11 00:53:46,950 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-11 00:53:46,951 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-11 00:53:46,953 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-11 00:53:46,954 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-11 00:53:46,955 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-11 00:53:46,956 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-11 00:53:46,957 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-11 00:53:46,959 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-11 00:53:46,960 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-11 00:53:46,961 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-11 00:53:46,962 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-11 00:53:46,963 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-11 00:53:46,963 INFO L280 TraceCheckUtils]: 35: Hoare triple {453#false} assume !false; {453#false} is VALID [2020-07-11 00:53:46,968 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-11 00:53:46,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1181864683] [2020-07-11 00:53:46,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:53:46,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-11 00:53:46,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832391173] [2020-07-11 00:53:46,970 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-11 00:53:46,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:53:46,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 00:53:47,013 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-11 00:53:47,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 00:53:47,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:53:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 00:53:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-11 00:53:47,015 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2020-07-11 00:53:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:47,952 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2020-07-11 00:53:47,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-11 00:53:47,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2020-07-11 00:53:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:53:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 00:53:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-07-11 00:53:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 00:53:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-07-11 00:53:47,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2020-07-11 00:53:48,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:53:48,009 INFO L225 Difference]: With dead ends: 30 [2020-07-11 00:53:48,009 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:53:48,011 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-11 00:53:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:53:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:53:48,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:53:48,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:48,012 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:48,012 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:48,012 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:53:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:53:48,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:48,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:53:48,013 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:48,013 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:53:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:53:48,013 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:53:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:53:48,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:48,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:53:48,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:53:48,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:53:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:53:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:53:48,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-11 00:53:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:53:48,015 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:53:48,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 00:53:48,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:53:48,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:53:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:53:48,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:53:48,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:53:48,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:53:48,496 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2020-07-11 00:53:48,655 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2020-07-11 00:53:48,789 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:53:48,790 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:53:48,790 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:53:48,790 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:53:48,790 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:53:48,790 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:53:48,790 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-11 00:53:48,791 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-11 00:53:48,791 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-11 00:53:48,791 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-11 00:53:48,791 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-11 00:53:48,791 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-11 00:53:48,792 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-11 00:53:48,792 INFO L264 CegarLoopResult]: At program point L3(lines 3 9) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-07-11 00:53:48,792 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-11 00:53:48,792 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-07-11 00:53:48,792 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: false [2020-07-11 00:53:48,792 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-07-11 00:53:48,793 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: (<= 2 main_~a~0) [2020-07-11 00:53:48,793 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: false [2020-07-11 00:53:48,793 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-11 00:53:48,793 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= 2 main_~a~0) (<= main_~a~0 2)) [2020-07-11 00:53:48,793 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 2 main_~a~0) (<= main_~a~0 2)) [2020-07-11 00:53:48,793 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-11 00:53:48,793 INFO L264 CegarLoopResult]: At program point L15-2(lines 11 18) the Hoare annotation is: (<= 2 main_~a~0) [2020-07-11 00:53:48,793 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-11 00:53:48,794 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-11 00:53:48,820 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-11 00:53:48,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:53:48 BoogieIcfgContainer [2020-07-11 00:53:48,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:53:48,836 INFO L168 Benchmark]: Toolchain (without parser) took 4900.21 ms. Allocated memory was 145.8 MB in the beginning and 270.5 MB in the end (delta: 124.8 MB). Free memory was 104.2 MB in the beginning and 172.7 MB in the end (delta: -68.5 MB). Peak memory consumption was 56.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:48,837 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 00:53:48,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.76 ms. Allocated memory is still 145.8 MB. Free memory was 104.0 MB in the beginning and 94.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:48,838 INFO L168 Benchmark]: Boogie Preprocessor took 30.70 ms. Allocated memory is still 145.8 MB. Free memory was 94.5 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-11 00:53:48,839 INFO L168 Benchmark]: RCFGBuilder took 390.45 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 93.0 MB in the beginning and 167.6 MB in the end (delta: -74.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:48,840 INFO L168 Benchmark]: TraceAbstraction took 4234.69 ms. Allocated memory was 203.9 MB in the beginning and 270.5 MB in the end (delta: 66.6 MB). Free memory was 167.6 MB in the beginning and 172.7 MB in the end (delta: -5.1 MB). Peak memory consumption was 61.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:53:48,844 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.19 ms. Allocated memory is still 145.8 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 238.76 ms. Allocated memory is still 145.8 MB. Free memory was 104.0 MB in the beginning and 94.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.70 ms. Allocated memory is still 145.8 MB. Free memory was 94.5 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 390.45 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 93.0 MB in the beginning and 167.6 MB in the end (delta: -74.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4234.69 ms. Allocated memory was 203.9 MB in the beginning and 270.5 MB in the end (delta: 66.6 MB). Free memory was 167.6 MB in the beginning and 172.7 MB in the end (delta: -5.1 MB). Peak memory consumption was 61.4 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.3s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 55 SDtfs, 60 SDslu, 181 SDs, 0 SdLazy, 193 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s 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.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 205 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, 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...