./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_2x3-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_2x3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5417ea5971c5cfa3624e07fbe8bf33ef4632cb6f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_2x3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5417ea5971c5cfa3624e07fbe8bf33ef4632cb6f ................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:13:18,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:13:18,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:13:18,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:13:18,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:13:18,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:13:18,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:13:18,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:13:18,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:13:18,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:13:18,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:13:18,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:13:18,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:13:18,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:13:18,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:13:18,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:13:18,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:13:18,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:13:18,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:13:18,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:13:18,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:13:18,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:13:18,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:13:18,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:13:18,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:13:18,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:13:18,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:13:18,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:13:18,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:13:18,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:13:18,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:13:18,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:13:18,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:13:18,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:13:18,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:13:18,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:13:18,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:13:18,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:13:18,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:13:18,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:13:18,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:13:18,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:13:18,939 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:13:18,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:13:18,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:13:18,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:13:18,947 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:13:18,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:13:18,947 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:13:18,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:13:18,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:13:18,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:13:18,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:13:18,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:13:18,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:13:18,949 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:13:18,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:13:18,951 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:13:18,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:13:18,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:13:18,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:13:18,952 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:13:18,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:13:18,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:13:18,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:13:18,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:13:18,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:13:18,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:13:18,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:13:18,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:13:18,955 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:13:18,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5417ea5971c5cfa3624e07fbe8bf33ef4632cb6f [2020-07-28 19:13:19,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:13:19,281 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:13:19,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:13:19,287 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:13:19,288 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:13:19,289 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_2x3-1.c [2020-07-28 19:13:19,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62a5ddda/2f12969d934141a4b8ff7883fc7a4abc/FLAGff1001078 [2020-07-28 19:13:19,840 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:13:19,840 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_2x3-1.c [2020-07-28 19:13:19,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62a5ddda/2f12969d934141a4b8ff7883fc7a4abc/FLAGff1001078 [2020-07-28 19:13:20,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c62a5ddda/2f12969d934141a4b8ff7883fc7a4abc [2020-07-28 19:13:20,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:13:20,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:13:20,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:20,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:13:20,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:13:20,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f357db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20, skipping insertion in model container [2020-07-28 19:13:20,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:13:20,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:13:20,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:20,554 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:13:20,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:20,587 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:13:20,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20 WrapperNode [2020-07-28 19:13:20,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:20,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:20,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:13:20,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:13:20,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:20,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:13:20,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:13:20,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:13:20,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (1/1) ... [2020-07-28 19:13:20,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:13:20,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:13:20,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:13:20,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:13:20,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (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-28 19:13:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:13:20,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:13:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-28 19:13:20,780 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-28 19:13:21,013 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:13:21,013 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:13:21,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:21 BoogieIcfgContainer [2020-07-28 19:13:21,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:13:21,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:13:21,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:13:21,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:13:21,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:13:20" (1/3) ... [2020-07-28 19:13:21,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3852e236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:21, skipping insertion in model container [2020-07-28 19:13:21,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:20" (2/3) ... [2020-07-28 19:13:21,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3852e236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:21, skipping insertion in model container [2020-07-28 19:13:21,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:21" (3/3) ... [2020-07-28 19:13:21,027 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-1.c [2020-07-28 19:13:21,041 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:13:21,049 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:13:21,065 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:13:21,095 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:13:21,096 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:13:21,096 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:13:21,096 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:13:21,097 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:13:21,097 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:13:21,097 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:13:21,098 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:13:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-07-28 19:13:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:13:21,126 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:21,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:21,128 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:21,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:21,136 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2020-07-28 19:13:21,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:21,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975621855] [2020-07-28 19:13:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:21,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:13:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:21,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} ~n := #in~n;~m := #in~m; {25#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:21,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {26#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:21,418 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#(<= |sum_#in~n| 0)} assume true; {26#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:21,421 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {26#(<= |sum_#in~n| 0)} {20#(<= 2 ULTIMATE.start_main_~a~0)} #24#return; {19#false} is VALID [2020-07-28 19:13:21,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 2;main_~b~0 := 3; {20#(<= 2 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 19:13:21,425 INFO L263 TraceCheckUtils]: 1: Hoare triple {20#(<= 2 ULTIMATE.start_main_~a~0)} call main_#t~ret1 := sum(main_~a~0, main_~b~0); {18#true} is VALID [2020-07-28 19:13:21,426 INFO L280 TraceCheckUtils]: 2: Hoare triple {18#true} ~n := #in~n;~m := #in~m; {25#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:21,428 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {26#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:21,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#(<= |sum_#in~n| 0)} assume true; {26#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:21,431 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {26#(<= |sum_#in~n| 0)} {20#(<= 2 ULTIMATE.start_main_~a~0)} #24#return; {19#false} is VALID [2020-07-28 19:13:21,431 INFO L280 TraceCheckUtils]: 6: Hoare triple {19#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {19#false} is VALID [2020-07-28 19:13:21,432 INFO L280 TraceCheckUtils]: 7: Hoare triple {19#false} assume main_~result~0 == main_~a~0 + main_~b~0; {19#false} is VALID [2020-07-28 19:13:21,432 INFO L280 TraceCheckUtils]: 8: Hoare triple {19#false} assume !false; {19#false} is VALID [2020-07-28 19:13:21,433 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-28 19:13:21,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975621855] [2020-07-28 19:13:21,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:21,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:13:21,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345067290] [2020-07-28 19:13:21,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:13:21,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:21,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:13:21,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:21,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:13:21,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:21,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:13:21,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:13:21,486 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-07-28 19:13:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:21,812 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-28 19:13:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:13:21,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:13:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:13:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 19:13:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:13:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 19:13:21,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-28 19:13:21,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:21,895 INFO L225 Difference]: With dead ends: 24 [2020-07-28 19:13:21,896 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 19:13:21,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-28 19:13:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 19:13:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-28 19:13:21,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:21,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:21,941 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:21,942 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:21,947 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 19:13:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:13:21,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:21,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:21,948 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:21,948 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:21,952 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 19:13:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:13:21,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:21,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:21,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:21,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 19:13:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-28 19:13:21,959 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2020-07-28 19:13:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:21,959 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-28 19:13:21,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:13:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:13:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 19:13:21,961 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:21,961 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:21,962 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:13:21,962 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2020-07-28 19:13:21,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:21,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500651059] [2020-07-28 19:13:21,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:22,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:13:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:22,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:13:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:22,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#true} ~n := #in~n;~m := #in~m; {116#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:22,156 INFO L280 TraceCheckUtils]: 1: Hoare triple {116#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {122#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:22,157 INFO L280 TraceCheckUtils]: 2: Hoare triple {122#(<= |sum_#in~n| 0)} assume true; {122#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:22,159 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {122#(<= |sum_#in~n| 0)} {116#(= sum_~n |sum_#in~n|)} #26#return; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#true} ~n := #in~n;~m := #in~m; {116#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:22,164 INFO L280 TraceCheckUtils]: 1: Hoare triple {116#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {116#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:22,164 INFO L263 TraceCheckUtils]: 2: Hoare triple {116#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {103#true} is VALID [2020-07-28 19:13:22,165 INFO L280 TraceCheckUtils]: 3: Hoare triple {103#true} ~n := #in~n;~m := #in~m; {116#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:22,167 INFO L280 TraceCheckUtils]: 4: Hoare triple {116#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {122#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:22,169 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#(<= |sum_#in~n| 0)} assume true; {122#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:22,172 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {122#(<= |sum_#in~n| 0)} {116#(= sum_~n |sum_#in~n|)} #26#return; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {121#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,177 INFO L280 TraceCheckUtils]: 8: Hoare triple {121#(<= |sum_#in~n| 1)} assume true; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,179 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {121#(<= |sum_#in~n| 1)} {105#(<= 2 ULTIMATE.start_main_~a~0)} #24#return; {104#false} is VALID [2020-07-28 19:13:22,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#true} havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 2;main_~b~0 := 3; {105#(<= 2 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 19:13:22,182 INFO L263 TraceCheckUtils]: 1: Hoare triple {105#(<= 2 ULTIMATE.start_main_~a~0)} call main_#t~ret1 := sum(main_~a~0, main_~b~0); {103#true} is VALID [2020-07-28 19:13:22,183 INFO L280 TraceCheckUtils]: 2: Hoare triple {103#true} ~n := #in~n;~m := #in~m; {116#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:22,185 INFO L280 TraceCheckUtils]: 3: Hoare triple {116#(= sum_~n |sum_#in~n|)} assume !(~n <= 0); {116#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:22,186 INFO L263 TraceCheckUtils]: 4: Hoare triple {116#(= sum_~n |sum_#in~n|)} call #t~ret0 := sum(~n - 1, 1 + ~m); {103#true} is VALID [2020-07-28 19:13:22,187 INFO L280 TraceCheckUtils]: 5: Hoare triple {103#true} ~n := #in~n;~m := #in~m; {116#(= sum_~n |sum_#in~n|)} is VALID [2020-07-28 19:13:22,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {116#(= sum_~n |sum_#in~n|)} assume ~n <= 0;#res := ~m + ~n; {122#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:22,191 INFO L280 TraceCheckUtils]: 7: Hoare triple {122#(<= |sum_#in~n| 0)} assume true; {122#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:22,194 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {122#(<= |sum_#in~n| 0)} {116#(= sum_~n |sum_#in~n|)} #26#return; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,195 INFO L280 TraceCheckUtils]: 9: Hoare triple {121#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,196 INFO L280 TraceCheckUtils]: 10: Hoare triple {121#(<= |sum_#in~n| 1)} assume true; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,199 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {121#(<= |sum_#in~n| 1)} {105#(<= 2 ULTIMATE.start_main_~a~0)} #24#return; {104#false} is VALID [2020-07-28 19:13:22,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {104#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {104#false} is VALID [2020-07-28 19:13:22,199 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#false} assume main_~result~0 == main_~a~0 + main_~b~0; {104#false} is VALID [2020-07-28 19:13:22,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {104#false} assume !false; {104#false} is VALID [2020-07-28 19:13:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:13:22,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500651059] [2020-07-28 19:13:22,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123184589] [2020-07-28 19:13:22,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:13:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:22,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:13:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:22,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:13:22,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#true} havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 2;main_~b~0 := 3; {105#(<= 2 ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 19:13:22,536 INFO L263 TraceCheckUtils]: 1: Hoare triple {105#(<= 2 ULTIMATE.start_main_~a~0)} call main_#t~ret1 := sum(main_~a~0, main_~b~0); {103#true} is VALID [2020-07-28 19:13:22,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {103#true} ~n := #in~n;~m := #in~m; {132#(<= |sum_#in~n| sum_~n)} is VALID [2020-07-28 19:13:22,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {132#(<= |sum_#in~n| sum_~n)} assume !(~n <= 0); {132#(<= |sum_#in~n| sum_~n)} is VALID [2020-07-28 19:13:22,538 INFO L263 TraceCheckUtils]: 4: Hoare triple {132#(<= |sum_#in~n| sum_~n)} call #t~ret0 := sum(~n - 1, 1 + ~m); {103#true} is VALID [2020-07-28 19:13:22,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {103#true} ~n := #in~n;~m := #in~m; {132#(<= |sum_#in~n| sum_~n)} is VALID [2020-07-28 19:13:22,541 INFO L280 TraceCheckUtils]: 6: Hoare triple {132#(<= |sum_#in~n| sum_~n)} assume ~n <= 0;#res := ~m + ~n; {122#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:22,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {122#(<= |sum_#in~n| 0)} assume true; {122#(<= |sum_#in~n| 0)} is VALID [2020-07-28 19:13:22,544 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {122#(<= |sum_#in~n| 0)} {132#(<= |sum_#in~n| sum_~n)} #26#return; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,545 INFO L280 TraceCheckUtils]: 9: Hoare triple {121#(<= |sum_#in~n| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {121#(<= |sum_#in~n| 1)} assume true; {121#(<= |sum_#in~n| 1)} is VALID [2020-07-28 19:13:22,548 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {121#(<= |sum_#in~n| 1)} {105#(<= 2 ULTIMATE.start_main_~a~0)} #24#return; {104#false} is VALID [2020-07-28 19:13:22,549 INFO L280 TraceCheckUtils]: 12: Hoare triple {104#false} assume -2147483648 <= main_#t~ret1 && main_#t~ret1 <= 2147483647;main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {104#false} is VALID [2020-07-28 19:13:22,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#false} assume main_~result~0 == main_~a~0 + main_~b~0; {104#false} is VALID [2020-07-28 19:13:22,550 INFO L280 TraceCheckUtils]: 14: Hoare triple {104#false} assume !false; {104#false} is VALID [2020-07-28 19:13:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:13:22,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:13:22,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-28 19:13:22,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298491643] [2020-07-28 19:13:22,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-28 19:13:22,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:22,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:13:22,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:22,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:13:22,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:13:22,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:13:22,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:13:22,585 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2020-07-28 19:13:22,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:22,726 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 19:13:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 19:13:22,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-07-28 19:13:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:13:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-28 19:13:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:13:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-28 19:13:22,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2020-07-28 19:13:22,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:22,768 INFO L225 Difference]: With dead ends: 21 [2020-07-28 19:13:22,768 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 19:13:22,769 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:13:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 19:13:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-28 19:13:22,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:22,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:22,777 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:22,777 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:22,780 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 19:13:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:13:22,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:22,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:22,782 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:22,782 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:22,785 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 19:13:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:13:22,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:22,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:22,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:22,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 19:13:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-07-28 19:13:22,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2020-07-28 19:13:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:22,790 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-28 19:13:22,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:13:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:13:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 19:13:22,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:22,792 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:23,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 19:13:23,007 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2020-07-28 19:13:23,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:13:23,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392804751] [2020-07-28 19:13:23,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:13:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:13:23,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:13:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:13:23,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:13:23,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 19:13:23,102 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 19:13:23,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 19:13:23,116 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret1 := sum(~a~0, ~b~0); [2020-07-28 19:13:23,118 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportCounterexampleResult(TraceAbstractionStarter.java:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:525) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 19:13:23,124 INFO L168 Benchmark]: Toolchain (without parser) took 2795.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.6 MB in the beginning and 965.9 MB in the end (delta: -4.3 MB). Peak memory consumption was 140.9 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:23,125 INFO L168 Benchmark]: CDTParser took 0.95 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:13:23,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.09 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:23,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:23,128 INFO L168 Benchmark]: Boogie Preprocessor took 20.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:23,129 INFO L168 Benchmark]: RCFGBuilder took 317.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:23,130 INFO L168 Benchmark]: TraceAbstraction took 2101.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.9 MB in the end (delta: 151.2 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:23,134 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.95 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.09 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 317.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2101.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.9 MB in the end (delta: 151.2 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:13:25,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:13:25,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:13:25,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:13:25,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:13:25,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:13:25,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:13:25,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:13:25,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:13:25,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:13:25,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:13:25,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:13:25,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:13:25,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:13:25,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:13:25,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:13:25,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:13:25,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:13:25,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:13:25,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:13:25,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:13:25,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:13:25,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:13:25,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:13:25,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:13:25,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:13:25,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:13:25,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:13:25,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:13:25,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:13:25,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:13:25,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:13:25,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:13:25,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:13:25,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:13:25,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:13:25,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:13:25,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:13:25,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:13:25,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:13:25,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:13:25,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 19:13:25,124 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:13:25,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:13:25,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:13:25,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:13:25,126 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:13:25,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:13:25,127 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:13:25,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:13:25,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:13:25,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:13:25,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:13:25,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:13:25,129 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 19:13:25,129 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 19:13:25,129 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:13:25,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:13:25,130 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:13:25,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:13:25,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:13:25,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:13:25,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:13:25,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:13:25,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:13:25,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:13:25,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:13:25,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:13:25,133 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 19:13:25,133 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 19:13:25,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:13:25,134 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:13:25,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 19:13:25,134 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5417ea5971c5cfa3624e07fbe8bf33ef4632cb6f [2020-07-28 19:13:25,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:13:25,462 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:13:25,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:13:25,467 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:13:25,467 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:13:25,468 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_2x3-1.c [2020-07-28 19:13:25,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368bf024b/8445e73e00e64015a9ece85886f2ef43/FLAG2212762ba [2020-07-28 19:13:25,895 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:13:25,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_2x3-1.c [2020-07-28 19:13:25,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368bf024b/8445e73e00e64015a9ece85886f2ef43/FLAG2212762ba [2020-07-28 19:13:26,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/368bf024b/8445e73e00e64015a9ece85886f2ef43 [2020-07-28 19:13:26,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:13:26,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:13:26,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:26,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:13:26,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:13:26,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ee3989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26, skipping insertion in model container [2020-07-28 19:13:26,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:13:26,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:13:26,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:26,473 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:13:26,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:13:26,507 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:13:26,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26 WrapperNode [2020-07-28 19:13:26,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:13:26,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:26,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:13:26,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:13:26,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:13:26,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:13:26,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:13:26,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:13:26,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (1/1) ... [2020-07-28 19:13:26,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:13:26,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:13:26,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:13:26,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:13:26,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (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-28 19:13:26,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:13:26,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:13:26,681 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-07-28 19:13:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-07-28 19:13:26,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:13:26,910 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:13:26,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:26 BoogieIcfgContainer [2020-07-28 19:13:26,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:13:26,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:13:26,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:13:26,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:13:26,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:13:26" (1/3) ... [2020-07-28 19:13:26,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e04dbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:26, skipping insertion in model container [2020-07-28 19:13:26,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:13:26" (2/3) ... [2020-07-28 19:13:26,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e04dbfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:13:26, skipping insertion in model container [2020-07-28 19:13:26,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:13:26" (3/3) ... [2020-07-28 19:13:26,925 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_2x3-1.c [2020-07-28 19:13:26,938 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:13:26,946 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:13:26,963 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:13:26,990 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:13:26,990 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:13:26,990 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:13:26,991 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:13:26,991 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:13:26,991 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:13:26,991 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:13:26,991 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:13:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-07-28 19:13:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:13:27,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:27,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:27,032 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2020-07-28 19:13:27,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:13:27,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461902313] [2020-07-28 19:13:27,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 19:13:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:27,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 19:13:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:27,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:13:27,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 2bv32;main_~b~0 := 3bv32; {23#(= (_ bv2 32) ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 19:13:27,274 INFO L263 TraceCheckUtils]: 1: Hoare triple {23#(= (_ bv2 32) ULTIMATE.start_main_~a~0)} call main_#t~ret1 := sum(main_~a~0, main_~b~0); {18#true} is VALID [2020-07-28 19:13:27,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {18#true} ~n := #in~n;~m := #in~m; {30#(= |sum_#in~n| sum_~n)} is VALID [2020-07-28 19:13:27,276 INFO L280 TraceCheckUtils]: 3: Hoare triple {30#(= |sum_#in~n| sum_~n)} assume ~bvsle32(~n, 0bv32);#res := ~bvadd32(~m, ~n); {34#(bvsle |sum_#in~n| (_ bv0 32))} is VALID [2020-07-28 19:13:27,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#(bvsle |sum_#in~n| (_ bv0 32))} assume true; {34#(bvsle |sum_#in~n| (_ bv0 32))} is VALID [2020-07-28 19:13:27,280 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {34#(bvsle |sum_#in~n| (_ bv0 32))} {23#(= (_ bv2 32) ULTIMATE.start_main_~a~0)} #24#return; {19#false} is VALID [2020-07-28 19:13:27,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {19#false} main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {19#false} is VALID [2020-07-28 19:13:27,280 INFO L280 TraceCheckUtils]: 7: Hoare triple {19#false} assume main_~result~0 == ~bvadd32(main_~a~0, main_~b~0); {19#false} is VALID [2020-07-28 19:13:27,281 INFO L280 TraceCheckUtils]: 8: Hoare triple {19#false} assume !false; {19#false} is VALID [2020-07-28 19:13:27,284 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-28 19:13:27,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:13:27,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {19#false} assume !false; {19#false} is VALID [2020-07-28 19:13:27,408 INFO L280 TraceCheckUtils]: 7: Hoare triple {19#false} assume main_~result~0 == ~bvadd32(main_~a~0, main_~b~0); {19#false} is VALID [2020-07-28 19:13:27,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {19#false} main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {19#false} is VALID [2020-07-28 19:13:27,411 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {34#(bvsle |sum_#in~n| (_ bv0 32))} {59#(not (bvsle ULTIMATE.start_main_~a~0 (_ bv0 32)))} #24#return; {19#false} is VALID [2020-07-28 19:13:27,412 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#(bvsle |sum_#in~n| (_ bv0 32))} assume true; {34#(bvsle |sum_#in~n| (_ bv0 32))} is VALID [2020-07-28 19:13:27,413 INFO L280 TraceCheckUtils]: 3: Hoare triple {69#(or (bvsle |sum_#in~n| (_ bv0 32)) (not (bvsle sum_~n (_ bv0 32))))} assume ~bvsle32(~n, 0bv32);#res := ~bvadd32(~m, ~n); {34#(bvsle |sum_#in~n| (_ bv0 32))} is VALID [2020-07-28 19:13:27,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {18#true} ~n := #in~n;~m := #in~m; {69#(or (bvsle |sum_#in~n| (_ bv0 32)) (not (bvsle sum_~n (_ bv0 32))))} is VALID [2020-07-28 19:13:27,415 INFO L263 TraceCheckUtils]: 1: Hoare triple {59#(not (bvsle ULTIMATE.start_main_~a~0 (_ bv0 32)))} call main_#t~ret1 := sum(main_~a~0, main_~b~0); {18#true} is VALID [2020-07-28 19:13:27,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 2bv32;main_~b~0 := 3bv32; {59#(not (bvsle ULTIMATE.start_main_~a~0 (_ bv0 32)))} is VALID [2020-07-28 19:13:27,417 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-28 19:13:27,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461902313] [2020-07-28 19:13:27,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:13:27,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2020-07-28 19:13:27,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671891273] [2020-07-28 19:13:27,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-07-28 19:13:27,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:27,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:13:27,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:27,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:13:27,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:13:27,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:13:27,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:13:27,480 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2020-07-28 19:13:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:27,867 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-28 19:13:27,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:13:27,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-07-28 19:13:27,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:13:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 19:13:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:13:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 19:13:27,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-28 19:13:27,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:27,955 INFO L225 Difference]: With dead ends: 24 [2020-07-28 19:13:27,956 INFO L226 Difference]: Without dead ends: 14 [2020-07-28 19:13:27,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:13:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-28 19:13:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-28 19:13:28,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:28,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:28,003 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:28,003 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:28,009 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 19:13:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:13:28,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:28,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:28,011 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:28,011 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-28 19:13:28,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:28,015 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-28 19:13:28,016 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:13:28,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:28,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:28,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:28,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 19:13:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-28 19:13:28,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2020-07-28 19:13:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:28,023 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-28 19:13:28,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:13:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-28 19:13:28,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 19:13:28,025 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:28,025 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:28,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 19:13:28,239 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:28,240 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2020-07-28 19:13:28,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:13:28,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974868899] [2020-07-28 19:13:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 19:13:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:28,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:13:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:13:28,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:13:28,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {149#true} havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 2bv32;main_~b~0 := 3bv32; {154#(= (_ bv2 32) ULTIMATE.start_main_~a~0)} is VALID [2020-07-28 19:13:28,363 INFO L263 TraceCheckUtils]: 1: Hoare triple {154#(= (_ bv2 32) ULTIMATE.start_main_~a~0)} call main_#t~ret1 := sum(main_~a~0, main_~b~0); {149#true} is VALID [2020-07-28 19:13:28,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {149#true} ~n := #in~n;~m := #in~m; {161#(= |sum_#in~n| sum_~n)} is VALID [2020-07-28 19:13:28,366 INFO L280 TraceCheckUtils]: 3: Hoare triple {161#(= |sum_#in~n| sum_~n)} assume !~bvsle32(~n, 0bv32); {161#(= |sum_#in~n| sum_~n)} is VALID [2020-07-28 19:13:28,366 INFO L263 TraceCheckUtils]: 4: Hoare triple {161#(= |sum_#in~n| sum_~n)} call #t~ret0 := sum(~bvsub32(~n, 1bv32), ~bvadd32(1bv32, ~m)); {149#true} is VALID [2020-07-28 19:13:28,367 INFO L280 TraceCheckUtils]: 5: Hoare triple {149#true} ~n := #in~n;~m := #in~m; {161#(= |sum_#in~n| sum_~n)} is VALID [2020-07-28 19:13:28,369 INFO L280 TraceCheckUtils]: 6: Hoare triple {161#(= |sum_#in~n| sum_~n)} assume ~bvsle32(~n, 0bv32);#res := ~bvadd32(~m, ~n); {174#(bvsle |sum_#in~n| (_ bv0 32))} is VALID [2020-07-28 19:13:28,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {174#(bvsle |sum_#in~n| (_ bv0 32))} assume true; {174#(bvsle |sum_#in~n| (_ bv0 32))} is VALID [2020-07-28 19:13:28,372 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {174#(bvsle |sum_#in~n| (_ bv0 32))} {161#(= |sum_#in~n| sum_~n)} #26#return; {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:13:28,373 INFO L280 TraceCheckUtils]: 9: Hoare triple {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} #res := #t~ret0;havoc #t~ret0; {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:13:28,374 INFO L280 TraceCheckUtils]: 10: Hoare triple {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} assume true; {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:13:28,376 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} {154#(= (_ bv2 32) ULTIMATE.start_main_~a~0)} #24#return; {150#false} is VALID [2020-07-28 19:13:28,376 INFO L280 TraceCheckUtils]: 12: Hoare triple {150#false} main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {150#false} is VALID [2020-07-28 19:13:28,377 INFO L280 TraceCheckUtils]: 13: Hoare triple {150#false} assume main_~result~0 == ~bvadd32(main_~a~0, main_~b~0); {150#false} is VALID [2020-07-28 19:13:28,377 INFO L280 TraceCheckUtils]: 14: Hoare triple {150#false} assume !false; {150#false} is VALID [2020-07-28 19:13:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:13:28,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 19:13:28,695 INFO L523 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-28 19:13:28,753 INFO L280 TraceCheckUtils]: 14: Hoare triple {150#false} assume !false; {150#false} is VALID [2020-07-28 19:13:28,756 INFO L280 TraceCheckUtils]: 13: Hoare triple {150#false} assume main_~result~0 == ~bvadd32(main_~a~0, main_~b~0); {150#false} is VALID [2020-07-28 19:13:28,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {150#false} main_~result~0 := main_#t~ret1;havoc main_#t~ret1; {150#false} is VALID [2020-07-28 19:13:28,758 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} {209#(not (bvsle (bvadd ULTIMATE.start_main_~a~0 (_ bv4294967295 32)) (_ bv0 32)))} #24#return; {150#false} is VALID [2020-07-28 19:13:28,761 INFO L280 TraceCheckUtils]: 10: Hoare triple {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} assume true; {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:13:28,762 INFO L280 TraceCheckUtils]: 9: Hoare triple {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} #res := #t~ret0;havoc #t~ret0; {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:13:28,765 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {174#(bvsle |sum_#in~n| (_ bv0 32))} {222#(or (bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsle (bvadd sum_~n (_ bv4294967295 32)) (_ bv0 32))))} #26#return; {181#(bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 19:13:28,766 INFO L280 TraceCheckUtils]: 7: Hoare triple {174#(bvsle |sum_#in~n| (_ bv0 32))} assume true; {174#(bvsle |sum_#in~n| (_ bv0 32))} is VALID [2020-07-28 19:13:28,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {232#(or (bvsle |sum_#in~n| (_ bv0 32)) (not (bvsle sum_~n (_ bv0 32))))} assume ~bvsle32(~n, 0bv32);#res := ~bvadd32(~m, ~n); {174#(bvsle |sum_#in~n| (_ bv0 32))} is VALID [2020-07-28 19:13:28,769 INFO L280 TraceCheckUtils]: 5: Hoare triple {149#true} ~n := #in~n;~m := #in~m; {232#(or (bvsle |sum_#in~n| (_ bv0 32)) (not (bvsle sum_~n (_ bv0 32))))} is VALID [2020-07-28 19:13:28,770 INFO L263 TraceCheckUtils]: 4: Hoare triple {222#(or (bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsle (bvadd sum_~n (_ bv4294967295 32)) (_ bv0 32))))} call #t~ret0 := sum(~bvsub32(~n, 1bv32), ~bvadd32(1bv32, ~m)); {149#true} is VALID [2020-07-28 19:13:28,771 INFO L280 TraceCheckUtils]: 3: Hoare triple {222#(or (bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsle (bvadd sum_~n (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsle32(~n, 0bv32); {222#(or (bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsle (bvadd sum_~n (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2020-07-28 19:13:28,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {149#true} ~n := #in~n;~m := #in~m; {222#(or (bvsle (bvadd |sum_#in~n| (_ bv4294967295 32)) (_ bv0 32)) (not (bvsle (bvadd sum_~n (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2020-07-28 19:13:28,773 INFO L263 TraceCheckUtils]: 1: Hoare triple {209#(not (bvsle (bvadd ULTIMATE.start_main_~a~0 (_ bv4294967295 32)) (_ bv0 32)))} call main_#t~ret1 := sum(main_~a~0, main_~b~0); {149#true} is VALID [2020-07-28 19:13:28,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {149#true} havoc main_#res;havoc main_#t~ret1, main_~a~0, main_~b~0, main_~result~0;main_~a~0 := 2bv32;main_~b~0 := 3bv32; {209#(not (bvsle (bvadd ULTIMATE.start_main_~a~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2020-07-28 19:13:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 19:13:28,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974868899] [2020-07-28 19:13:28,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:13:28,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-28 19:13:28,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948743611] [2020-07-28 19:13:28,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-28 19:13:28,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:13:28,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 19:13:28,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:28,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 19:13:28,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 19:13:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 19:13:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-28 19:13:28,850 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2020-07-28 19:13:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:29,218 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 19:13:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 19:13:29,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-07-28 19:13:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:13:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:13:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-28 19:13:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 19:13:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-07-28 19:13:29,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2020-07-28 19:13:29,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:13:29,277 INFO L225 Difference]: With dead ends: 21 [2020-07-28 19:13:29,277 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 19:13:29,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-28 19:13:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 19:13:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-28 19:13:29,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:13:29,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:29,290 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:29,290 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:29,293 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 19:13:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:13:29,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:29,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:29,294 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:29,294 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 19:13:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:13:29,297 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 19:13:29,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:13:29,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:13:29,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:13:29,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:13:29,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:13:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 19:13:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2020-07-28 19:13:29,302 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2020-07-28 19:13:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:13:29,303 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2020-07-28 19:13:29,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 19:13:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 19:13:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 19:13:29,304 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:13:29,304 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:13:29,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 19:13:29,516 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:13:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:13:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2020-07-28 19:13:29,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 19:13:29,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870001046] [2020-07-28 19:13:29,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 19:13:29,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 19:13:29,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-28 19:13:29,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:13:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 19:13:29,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 19:13:29,583 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 19:13:29,584 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 19:13:29,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 19:13:29,802 FATAL L488 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret1 := sum(~a~0, ~b~0); [2020-07-28 19:13:29,803 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportCounterexampleResult(TraceAbstractionStarter.java:626) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResults(TraceAbstractionStarter.java:525) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 19:13:29,810 INFO L168 Benchmark]: Toolchain (without parser) took 3539.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 957.5 MB in the beginning and 945.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 158.4 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:29,811 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:13:29,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.18 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:29,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.30 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:13:29,814 INFO L168 Benchmark]: Boogie Preprocessor took 77.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:29,814 INFO L168 Benchmark]: RCFGBuilder took 297.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:29,815 INFO L168 Benchmark]: TraceAbstraction took 2890.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 945.4 MB in the end (delta: 179.9 MB). Peak memory consumption was 179.9 MB. Max. memory is 11.5 GB. [2020-07-28 19:13:29,820 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 236.18 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.30 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2890.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 945.4 MB in the end (delta: 179.9 MB). Peak memory consumption was 179.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:216) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...