./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Addition03-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/Addition03-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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b4726bd085117d6d28f7ec87f442bbec9d0d87c17bc39b8147695c8c5a6ec7b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:13:22,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:13:22,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:13:22,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:13:22,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:13:22,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:13:22,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:13:22,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:13:22,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:13:22,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:13:22,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:13:22,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:13:22,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:13:22,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:13:22,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:13:22,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:13:22,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:13:22,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:13:22,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:13:22,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:13:22,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:13:22,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:13:22,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:13:22,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:13:22,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:13:22,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:13:22,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:13:22,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:13:22,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:13:22,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:13:22,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:13:22,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:13:22,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:13:22,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:13:22,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:13:22,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:13:22,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:13:22,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:13:22,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:13:22,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:13:22,814 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:13:22,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:13:22,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:13:22,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:13:22,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:13:22,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:13:22,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:13:22,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:13:22,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:13:22,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:13:22,845 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:13:22,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:13:22,845 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:13:22,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:13:22,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:13:22,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:13:22,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:13:22,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:13:22,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:13:22,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:13:22,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:13:22,847 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:13:22,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:13:22,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:13:22,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:13:22,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:13:22,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:22,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:13:22,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:13:22,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:13:22,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:13:22,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:13:22,848 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:13:22,848 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:13:22,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:13:22,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 2b4726bd085117d6d28f7ec87f442bbec9d0d87c17bc39b8147695c8c5a6ec7b [2022-02-20 18:13:23,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:13:23,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:13:23,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:13:23,114 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:13:23,114 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:13:23,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Addition03-1.c [2022-02-20 18:13:23,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58047b45a/fede1aceddc64b4d9298ef08433609ed/FLAG5290036c4 [2022-02-20 18:13:23,488 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:13:23,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition03-1.c [2022-02-20 18:13:23,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58047b45a/fede1aceddc64b4d9298ef08433609ed/FLAG5290036c4 [2022-02-20 18:13:23,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58047b45a/fede1aceddc64b4d9298ef08433609ed [2022-02-20 18:13:23,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:13:23,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:13:23,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:23,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:13:23,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:13:23,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:23" (1/1) ... [2022-02-20 18:13:23,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3787528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:23, skipping insertion in model container [2022-02-20 18:13:23,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:23" (1/1) ... [2022-02-20 18:13:23,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:13:23,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:13:24,092 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition03-1.c[840,853] [2022-02-20 18:13:24,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:24,102 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:13:24,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition03-1.c[840,853] [2022-02-20 18:13:24,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:24,149 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:13:24,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24 WrapperNode [2022-02-20 18:13:24,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:24,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:24,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:13:24,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:13:24,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,214 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-20 18:13:24,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:24,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:13:24,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:13:24,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:13:24,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:13:24,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:13:24,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:13:24,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:13:24,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (1/1) ... [2022-02-20 18:13:24,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:24,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:24,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:13:24,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:13:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:13:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:13:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:13:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:13:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2022-02-20 18:13:24,308 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2022-02-20 18:13:24,351 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:13:24,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:13:24,483 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:13:24,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:13:24,490 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:13:24,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:24 BoogieIcfgContainer [2022-02-20 18:13:24,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:13:24,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:13:24,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:13:24,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:13:24,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:13:23" (1/3) ... [2022-02-20 18:13:24,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f23ef9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:24, skipping insertion in model container [2022-02-20 18:13:24,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:24" (2/3) ... [2022-02-20 18:13:24,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f23ef9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:24, skipping insertion in model container [2022-02-20 18:13:24,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:24" (3/3) ... [2022-02-20 18:13:24,499 INFO L111 eAbstractionObserver]: Analyzing ICFG Addition03-1.c [2022-02-20 18:13:24,503 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:13:24,504 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:13:24,552 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:13:24,571 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:13:24,587 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:13:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 18:13:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:13:24,626 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:24,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:24,627 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash -100249854, now seen corresponding path program 1 times [2022-02-20 18:13:24,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:24,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314772356] [2022-02-20 18:13:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:24,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:13:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:24,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} ~m := #in~m;~n := #in~n; {30#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:24,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {31#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:24,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#(= |addition_#in~n| 0)} assume true; {31#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:24,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#(= |addition_#in~n| 0)} {23#true} #35#return; {29#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 18:13:24,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-02-20 18:13:24,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {23#true} is VALID [2022-02-20 18:13:24,945 INFO L272 TraceCheckUtils]: 2: Hoare triple {23#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {23#true} is VALID [2022-02-20 18:13:24,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#true} ~m := #in~m;~n := #in~n; {30#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:24,947 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {31#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:24,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#(= |addition_#in~n| 0)} assume true; {31#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:24,949 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31#(= |addition_#in~n| 0)} {23#true} #35#return; {29#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 18:13:24,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {29#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 18:13:24,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(<= |ULTIMATE.start_main_~n~0#1| 0)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {24#false} is VALID [2022-02-20 18:13:24,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 18:13:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:13:24,953 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:24,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314772356] [2022-02-20 18:13:24,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314772356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:24,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:13:24,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:13:24,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282867816] [2022-02-20 18:13:24,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:24,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-02-20 18:13:24,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:24,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:24,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:24,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:13:24,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:25,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:13:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:13:25,021 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:25,241 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 18:13:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:13:25,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-02-20 18:13:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 18:13:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 18:13:25,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-20 18:13:25,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:25,298 INFO L225 Difference]: With dead ends: 32 [2022-02-20 18:13:25,298 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 18:13:25,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:13:25,304 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:25,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 41 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 18:13:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 18:13:25,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:25,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:25,336 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:25,336 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:25,340 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 18:13:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 18:13:25,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:25,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:25,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 19 states. [2022-02-20 18:13:25,342 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 19 states. [2022-02-20 18:13:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:25,346 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 18:13:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 18:13:25,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:25,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:25,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:25,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-02-20 18:13:25,351 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2022-02-20 18:13:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:25,351 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-20 18:13:25,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 18:13:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 18:13:25,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:25,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:25,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:13:25,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:25,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2083914533, now seen corresponding path program 1 times [2022-02-20 18:13:25,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:25,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956371143] [2022-02-20 18:13:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:13:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#true} ~m := #in~m;~n := #in~n; {136#true} is VALID [2022-02-20 18:13:25,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume !(0 == ~n); {144#(not (= addition_~n 0))} is VALID [2022-02-20 18:13:25,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(not (= addition_~n 0))} assume !(~n > 0); {145#(and (not (= addition_~n 0)) (<= addition_~n 0))} is VALID [2022-02-20 18:13:25,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {145#(and (not (= addition_~n 0)) (<= addition_~n 0))} assume !(~n < 0); {137#false} is VALID [2022-02-20 18:13:25,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {137#false} assume true; {137#false} is VALID [2022-02-20 18:13:25,433 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {137#false} {136#true} #35#return; {137#false} is VALID [2022-02-20 18:13:25,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-02-20 18:13:25,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {136#true} is VALID [2022-02-20 18:13:25,434 INFO L272 TraceCheckUtils]: 2: Hoare triple {136#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {136#true} is VALID [2022-02-20 18:13:25,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {136#true} ~m := #in~m;~n := #in~n; {136#true} is VALID [2022-02-20 18:13:25,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {136#true} assume !(0 == ~n); {144#(not (= addition_~n 0))} is VALID [2022-02-20 18:13:25,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {144#(not (= addition_~n 0))} assume !(~n > 0); {145#(and (not (= addition_~n 0)) (<= addition_~n 0))} is VALID [2022-02-20 18:13:25,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#(and (not (= addition_~n 0)) (<= addition_~n 0))} assume !(~n < 0); {137#false} is VALID [2022-02-20 18:13:25,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {137#false} assume true; {137#false} is VALID [2022-02-20 18:13:25,436 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {137#false} {136#true} #35#return; {137#false} is VALID [2022-02-20 18:13:25,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {137#false} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {137#false} is VALID [2022-02-20 18:13:25,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {137#false} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {137#false} is VALID [2022-02-20 18:13:25,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {137#false} assume !false; {137#false} is VALID [2022-02-20 18:13:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:13:25,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:25,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956371143] [2022-02-20 18:13:25,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956371143] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:25,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:13:25,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:13:25,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335231713] [2022-02-20 18:13:25,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:25,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 18:13:25,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:25,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:25,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:13:25,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:13:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:13:25,453 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:25,512 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-02-20 18:13:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:13:25,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 18:13:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 18:13:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 18:13:25,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 18:13:25,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:25,554 INFO L225 Difference]: With dead ends: 29 [2022-02-20 18:13:25,555 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 18:13:25,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:13:25,556 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:25,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 44 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:13:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 18:13:25,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-02-20 18:13:25,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:25,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:25,562 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:25,562 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:25,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:25,565 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-20 18:13:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 18:13:25,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:25,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:25,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 21 states. [2022-02-20 18:13:25,566 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 21 states. [2022-02-20 18:13:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:25,568 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-20 18:13:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 18:13:25,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:25,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:25,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:25,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 18:13:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 18:13:25,571 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-02-20 18:13:25,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:25,572 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 18:13:25,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 18:13:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 18:13:25,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:25,573 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:25,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:13:25,573 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:25,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1402250658, now seen corresponding path program 1 times [2022-02-20 18:13:25,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:25,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172283147] [2022-02-20 18:13:25,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:13:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {266#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:25,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#(= |addition_#in~n| 0)} assume true; {266#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:25,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266#(= |addition_#in~n| 0)} {260#(= |addition_#in~n| addition_~n)} #37#return; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#(= |addition_#in~n| addition_~n)} assume ~n > 0; {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,673 INFO L272 TraceCheckUtils]: 3: Hoare triple {260#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {246#true} is VALID [2022-02-20 18:13:25,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {266#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:25,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#(= |addition_#in~n| 0)} assume true; {266#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:25,676 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {266#(= |addition_#in~n| 0)} {260#(= |addition_#in~n| addition_~n)} #37#return; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {265#(<= |addition_#in~n| 1)} assume true; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {265#(<= |addition_#in~n| 1)} {246#true} #35#return; {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 18:13:25,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 18:13:25,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {246#true} is VALID [2022-02-20 18:13:25,678 INFO L272 TraceCheckUtils]: 2: Hoare triple {246#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {246#true} is VALID [2022-02-20 18:13:25,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {260#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#(= |addition_#in~n| addition_~n)} assume ~n > 0; {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {260#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {246#true} is VALID [2022-02-20 18:13:25,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {260#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {260#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {266#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:25,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#(= |addition_#in~n| 0)} assume true; {266#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:25,682 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {266#(= |addition_#in~n| 0)} {260#(= |addition_#in~n| addition_~n)} #37#return; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(<= |addition_#in~n| 1)} assume true; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,684 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {265#(<= |addition_#in~n| 1)} {246#true} #35#return; {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 18:13:25,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 18:13:25,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {247#false} is VALID [2022-02-20 18:13:25,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 18:13:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:13:25,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:25,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172283147] [2022-02-20 18:13:25,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172283147] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:25,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358160831] [2022-02-20 18:13:25,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:25,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:25,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:25,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:25,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:13:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:13:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:25,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:25,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 18:13:25,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {246#true} is VALID [2022-02-20 18:13:25,930 INFO L272 TraceCheckUtils]: 2: Hoare triple {246#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {246#true} is VALID [2022-02-20 18:13:25,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {279#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {279#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {279#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {279#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,932 INFO L272 TraceCheckUtils]: 6: Hoare triple {279#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {246#true} is VALID [2022-02-20 18:13:25,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {279#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:25,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {279#(<= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {295#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:25,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#(<= |addition_#in~n| 0)} assume true; {295#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:25,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#(<= |addition_#in~n| 0)} {279#(<= |addition_#in~n| addition_~n)} #37#return; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(<= |addition_#in~n| 1)} assume true; {265#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:25,936 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {265#(<= |addition_#in~n| 1)} {246#true} #35#return; {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 18:13:25,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} is VALID [2022-02-20 18:13:25,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {259#(<= |ULTIMATE.start_main_~n~0#1| 1)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {247#false} is VALID [2022-02-20 18:13:25,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 18:13:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:13:25,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:26,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-02-20 18:13:26,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {323#(< |ULTIMATE.start_main_~n~0#1| 100)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {247#false} is VALID [2022-02-20 18:13:26,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {323#(< |ULTIMATE.start_main_~n~0#1| 100)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {323#(< |ULTIMATE.start_main_~n~0#1| 100)} is VALID [2022-02-20 18:13:26,483 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {333#(< |addition_#in~n| 100)} {246#true} #35#return; {323#(< |ULTIMATE.start_main_~n~0#1| 100)} is VALID [2022-02-20 18:13:26,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {333#(< |addition_#in~n| 100)} assume true; {333#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:26,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {333#(< |addition_#in~n| 100)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {333#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:26,486 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#(<= |addition_#in~n| 0)} {343#(or (< |addition_#in~n| 100) (< 1 addition_~n))} #37#return; {333#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:26,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#(<= |addition_#in~n| 0)} assume true; {295#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:26,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(or (<= |addition_#in~n| 0) (not (<= addition_~n 0)))} assume 0 == ~n;#res := ~m; {295#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:26,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {353#(or (<= |addition_#in~n| 0) (not (<= addition_~n 0)))} is VALID [2022-02-20 18:13:26,491 INFO L272 TraceCheckUtils]: 6: Hoare triple {343#(or (< |addition_#in~n| 100) (< 1 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {246#true} is VALID [2022-02-20 18:13:26,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#(or (< |addition_#in~n| 100) (< 1 addition_~n))} assume ~n > 0; {343#(or (< |addition_#in~n| 100) (< 1 addition_~n))} is VALID [2022-02-20 18:13:26,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {343#(or (< |addition_#in~n| 100) (< 1 addition_~n))} assume !(0 == ~n); {343#(or (< |addition_#in~n| 100) (< 1 addition_~n))} is VALID [2022-02-20 18:13:26,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#true} ~m := #in~m;~n := #in~n; {343#(or (< |addition_#in~n| 100) (< 1 addition_~n))} is VALID [2022-02-20 18:13:26,492 INFO L272 TraceCheckUtils]: 2: Hoare triple {246#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {246#true} is VALID [2022-02-20 18:13:26,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {246#true} is VALID [2022-02-20 18:13:26,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-02-20 18:13:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:13:26,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358160831] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:26,494 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:26,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-02-20 18:13:26,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839228703] [2022-02-20 18:13:26,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:26,499 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 17 [2022-02-20 18:13:26,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:26,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:26,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:26,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:13:26,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:26,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:13:26,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:13:26,530 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:26,834 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-02-20 18:13:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:13:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 17 [2022-02-20 18:13:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2022-02-20 18:13:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2022-02-20 18:13:26,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2022-02-20 18:13:26,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:26,907 INFO L225 Difference]: With dead ends: 54 [2022-02-20 18:13:26,907 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 18:13:26,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:13:26,909 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:26,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 18:13:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-02-20 18:13:26,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:26,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 18:13:26,918 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 18:13:26,918 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 18:13:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:26,921 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 18:13:26,921 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 18:13:26,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:26,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:26,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Second operand 34 states. [2022-02-20 18:13:26,923 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Second operand 34 states. [2022-02-20 18:13:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:26,926 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 18:13:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 18:13:26,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:26,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:26,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:26,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:26,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 18:13:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 18:13:26,930 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2022-02-20 18:13:26,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:26,930 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 18:13:26,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 18:13:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 18:13:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 18:13:26,932 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:26,932 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:26,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:13:27,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:27,146 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1901242716, now seen corresponding path program 2 times [2022-02-20 18:13:27,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:27,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578285982] [2022-02-20 18:13:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:27,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:13:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:27,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:27,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {615#(= |addition_#in~n| 0)} assume true; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {615#(= |addition_#in~n| 0)} {578#(= |addition_#in~n| addition_~n)} #37#return; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,303 INFO L272 TraceCheckUtils]: 3: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= |addition_#in~n| 0)} assume true; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,305 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {615#(= |addition_#in~n| 0)} {578#(= |addition_#in~n| addition_~n)} #37#return; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {614#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#(<= |addition_#in~n| 1)} assume true; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {614#(<= |addition_#in~n| 1)} {578#(= |addition_#in~n| addition_~n)} #37#return; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,309 INFO L272 TraceCheckUtils]: 3: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,311 INFO L272 TraceCheckUtils]: 7: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {615#(= |addition_#in~n| 0)} assume true; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,313 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {615#(= |addition_#in~n| 0)} {578#(= |addition_#in~n| addition_~n)} #37#return; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#(<= |addition_#in~n| 1)} assume true; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,315 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {614#(<= |addition_#in~n| 1)} {578#(= |addition_#in~n| addition_~n)} #37#return; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {609#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#(<= |addition_#in~n| 2)} assume true; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,317 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {609#(<= |addition_#in~n| 2)} {578#(= |addition_#in~n| addition_~n)} #37#return; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,319 INFO L272 TraceCheckUtils]: 3: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,319 INFO L290 TraceCheckUtils]: 4: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,320 INFO L272 TraceCheckUtils]: 7: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(= |addition_#in~n| 0)} assume true; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,324 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {615#(= |addition_#in~n| 0)} {578#(= |addition_#in~n| addition_~n)} #37#return; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {614#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(<= |addition_#in~n| 1)} assume true; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,326 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {614#(<= |addition_#in~n| 1)} {578#(= |addition_#in~n| addition_~n)} #37#return; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {609#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {609#(<= |addition_#in~n| 2)} assume true; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,328 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {609#(<= |addition_#in~n| 2)} {578#(= |addition_#in~n| addition_~n)} #37#return; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {597#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {597#(<= |addition_#in~n| 3)} assume true; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,330 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {597#(<= |addition_#in~n| 3)} {550#true} #35#return; {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 18:13:27,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-02-20 18:13:27,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {550#true} is VALID [2022-02-20 18:13:27,330 INFO L272 TraceCheckUtils]: 2: Hoare triple {550#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {550#true} is VALID [2022-02-20 18:13:27,331 INFO L290 TraceCheckUtils]: 3: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,332 INFO L272 TraceCheckUtils]: 6: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,334 INFO L272 TraceCheckUtils]: 10: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume ~n > 0; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,335 INFO L272 TraceCheckUtils]: 14: Hoare triple {578#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {578#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {615#(= |addition_#in~n| 0)} assume true; {615#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,338 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {615#(= |addition_#in~n| 0)} {578#(= |addition_#in~n| addition_~n)} #37#return; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {614#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {614#(<= |addition_#in~n| 1)} assume true; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,340 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {614#(<= |addition_#in~n| 1)} {578#(= |addition_#in~n| addition_~n)} #37#return; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {609#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {609#(<= |addition_#in~n| 2)} assume true; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,342 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {609#(<= |addition_#in~n| 2)} {578#(= |addition_#in~n| addition_~n)} #37#return; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {597#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {597#(<= |addition_#in~n| 3)} assume true; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,343 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {597#(<= |addition_#in~n| 3)} {550#true} #35#return; {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 18:13:27,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 18:13:27,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {551#false} is VALID [2022-02-20 18:13:27,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-02-20 18:13:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 18:13:27,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:27,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578285982] [2022-02-20 18:13:27,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578285982] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:27,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244221153] [2022-02-20 18:13:27,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:13:27,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:27,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:27,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:27,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 18:13:27,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:13:27,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:27,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 18:13:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:27,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:27,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-02-20 18:13:27,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {550#true} is VALID [2022-02-20 18:13:27,684 INFO L272 TraceCheckUtils]: 2: Hoare triple {550#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {550#true} is VALID [2022-02-20 18:13:27,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {628#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {628#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {628#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,689 INFO L272 TraceCheckUtils]: 10: Hoare triple {628#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {628#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {628#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,694 INFO L272 TraceCheckUtils]: 14: Hoare triple {628#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:27,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {628#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:27,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#(<= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {668#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {668#(<= |addition_#in~n| 0)} assume true; {668#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:27,697 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {668#(<= |addition_#in~n| 0)} {628#(<= |addition_#in~n| addition_~n)} #37#return; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {614#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {614#(<= |addition_#in~n| 1)} assume true; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:27,700 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {614#(<= |addition_#in~n| 1)} {628#(<= |addition_#in~n| addition_~n)} #37#return; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {609#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {609#(<= |addition_#in~n| 2)} assume true; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:27,709 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {609#(<= |addition_#in~n| 2)} {628#(<= |addition_#in~n| addition_~n)} #37#return; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {597#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {597#(<= |addition_#in~n| 3)} assume true; {597#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:27,710 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {597#(<= |addition_#in~n| 3)} {550#true} #35#return; {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 18:13:27,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} is VALID [2022-02-20 18:13:27,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {577#(<= |ULTIMATE.start_main_~n~0#1| 3)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {551#false} is VALID [2022-02-20 18:13:27,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-02-20 18:13:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 18:13:27,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:29,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-02-20 18:13:29,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {714#(< |ULTIMATE.start_main_~n~0#1| 100)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {551#false} is VALID [2022-02-20 18:13:29,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {714#(< |ULTIMATE.start_main_~n~0#1| 100)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {714#(< |ULTIMATE.start_main_~n~0#1| 100)} is VALID [2022-02-20 18:13:29,501 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {724#(< |addition_#in~n| 100)} {550#true} #35#return; {714#(< |ULTIMATE.start_main_~n~0#1| 100)} is VALID [2022-02-20 18:13:29,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {724#(< |addition_#in~n| 100)} assume true; {724#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:29,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {724#(< |addition_#in~n| 100)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {724#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:29,503 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {609#(<= |addition_#in~n| 2)} {734#(or (< |addition_#in~n| 100) (< 3 addition_~n))} #37#return; {724#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:29,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {609#(<= |addition_#in~n| 2)} assume true; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:29,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {609#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:29,505 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {614#(<= |addition_#in~n| 1)} {747#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} #37#return; {609#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:29,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {614#(<= |addition_#in~n| 1)} assume true; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:29,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {614#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:29,507 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {668#(<= |addition_#in~n| 0)} {760#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} #37#return; {614#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:29,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {668#(<= |addition_#in~n| 0)} assume true; {668#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:29,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#(or (<= |addition_#in~n| 0) (not (<= addition_~n 0)))} assume 0 == ~n;#res := ~m; {668#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:29,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {770#(or (<= |addition_#in~n| 0) (not (<= addition_~n 0)))} is VALID [2022-02-20 18:13:29,509 INFO L272 TraceCheckUtils]: 14: Hoare triple {760#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:29,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} assume ~n > 0; {760#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:29,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} assume !(0 == ~n); {760#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:29,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {760#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:29,511 INFO L272 TraceCheckUtils]: 10: Hoare triple {747#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:29,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {747#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} assume ~n > 0; {747#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:29,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {747#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} assume !(0 == ~n); {747#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:29,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {747#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:29,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {734#(or (< |addition_#in~n| 100) (< 3 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {550#true} is VALID [2022-02-20 18:13:29,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {734#(or (< |addition_#in~n| 100) (< 3 addition_~n))} assume ~n > 0; {734#(or (< |addition_#in~n| 100) (< 3 addition_~n))} is VALID [2022-02-20 18:13:29,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {734#(or (< |addition_#in~n| 100) (< 3 addition_~n))} assume !(0 == ~n); {734#(or (< |addition_#in~n| 100) (< 3 addition_~n))} is VALID [2022-02-20 18:13:29,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {550#true} ~m := #in~m;~n := #in~n; {734#(or (< |addition_#in~n| 100) (< 3 addition_~n))} is VALID [2022-02-20 18:13:29,514 INFO L272 TraceCheckUtils]: 2: Hoare triple {550#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {550#true} is VALID [2022-02-20 18:13:29,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {550#true} is VALID [2022-02-20 18:13:29,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-02-20 18:13:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:13:29,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244221153] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:29,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:29,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 16 [2022-02-20 18:13:29,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134318095] [2022-02-20 18:13:29,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:29,517 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 31 [2022-02-20 18:13:29,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:29,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:13:29,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:29,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 18:13:29,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:29,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 18:13:29,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:13:29,565 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:13:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:29,943 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-02-20 18:13:29,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:13:29,943 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 31 [2022-02-20 18:13:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:13:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-02-20 18:13:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:13:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-02-20 18:13:29,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-02-20 18:13:30,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:30,008 INFO L225 Difference]: With dead ends: 46 [2022-02-20 18:13:30,009 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 18:13:30,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:13:30,010 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:30,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 73 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:13:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 18:13:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-02-20 18:13:30,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:30,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 18:13:30,019 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 18:13:30,019 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 18:13:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:30,022 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-20 18:13:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-20 18:13:30,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:30,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:30,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Second operand 40 states. [2022-02-20 18:13:30,023 INFO L87 Difference]: Start difference. First operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Second operand 40 states. [2022-02-20 18:13:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:30,025 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-02-20 18:13:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-02-20 18:13:30,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:30,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:30,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:30,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 18:13:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-02-20 18:13:30,029 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 31 [2022-02-20 18:13:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:30,029 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-02-20 18:13:30,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 18:13:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 18:13:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 18:13:30,030 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:30,030 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:30,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 18:13:30,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 18:13:30,252 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2146751834, now seen corresponding path program 3 times [2022-02-20 18:13:30,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:30,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255852307] [2022-02-20 18:13:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:30,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:13:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:30,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:30,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:30,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {1134#(= |addition_#in~n| 0)} assume true; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1134#(= |addition_#in~n| 0)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,613 INFO L272 TraceCheckUtils]: 3: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {1134#(= |addition_#in~n| 0)} assume true; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,615 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1134#(= |addition_#in~n| 0)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {1133#(<= |addition_#in~n| 1)} assume true; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,617 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1133#(<= |addition_#in~n| 1)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,619 INFO L272 TraceCheckUtils]: 3: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,620 INFO L272 TraceCheckUtils]: 7: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {1134#(= |addition_#in~n| 0)} assume true; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,623 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1134#(= |addition_#in~n| 0)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {1133#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {1133#(<= |addition_#in~n| 1)} assume true; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,624 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1133#(<= |addition_#in~n| 1)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {1128#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {1128#(<= |addition_#in~n| 2)} assume true; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,626 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1128#(<= |addition_#in~n| 2)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,628 INFO L272 TraceCheckUtils]: 3: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,630 INFO L272 TraceCheckUtils]: 7: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,631 INFO L272 TraceCheckUtils]: 11: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(= |addition_#in~n| 0)} assume true; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,633 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1134#(= |addition_#in~n| 0)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1133#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {1133#(<= |addition_#in~n| 1)} assume true; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,635 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1133#(<= |addition_#in~n| 1)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#(<= |addition_#in~n| 2)} assume true; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,636 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1128#(<= |addition_#in~n| 2)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {1116#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {1116#(<= |addition_#in~n| 3)} assume true; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,639 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1116#(<= |addition_#in~n| 3)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,641 INFO L272 TraceCheckUtils]: 3: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,643 INFO L272 TraceCheckUtils]: 7: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,644 INFO L272 TraceCheckUtils]: 11: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,648 INFO L272 TraceCheckUtils]: 15: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {1134#(= |addition_#in~n| 0)} assume true; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,650 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1134#(= |addition_#in~n| 0)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {1133#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {1133#(<= |addition_#in~n| 1)} assume true; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,651 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1133#(<= |addition_#in~n| 1)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {1128#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {1128#(<= |addition_#in~n| 2)} assume true; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,653 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1128#(<= |addition_#in~n| 2)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {1116#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {1116#(<= |addition_#in~n| 3)} assume true; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,655 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1116#(<= |addition_#in~n| 3)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {1097#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {1097#(<= |addition_#in~n| 4)} assume true; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,656 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1097#(<= |addition_#in~n| 4)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:30,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,658 INFO L272 TraceCheckUtils]: 3: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,660 INFO L272 TraceCheckUtils]: 7: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,661 INFO L272 TraceCheckUtils]: 11: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,663 INFO L272 TraceCheckUtils]: 15: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,664 INFO L272 TraceCheckUtils]: 19: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,665 INFO L290 TraceCheckUtils]: 21: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {1134#(= |addition_#in~n| 0)} assume true; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,666 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1134#(= |addition_#in~n| 0)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {1133#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {1133#(<= |addition_#in~n| 1)} assume true; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,667 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1133#(<= |addition_#in~n| 1)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {1128#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {1128#(<= |addition_#in~n| 2)} assume true; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,669 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1128#(<= |addition_#in~n| 2)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {1116#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {1116#(<= |addition_#in~n| 3)} assume true; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,670 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1116#(<= |addition_#in~n| 3)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {1097#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {1097#(<= |addition_#in~n| 4)} assume true; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,672 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1097#(<= |addition_#in~n| 4)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:30,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {1071#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:30,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {1071#(<= |addition_#in~n| 5)} assume true; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:30,673 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1071#(<= |addition_#in~n| 5)} {996#true} #35#return; {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} is VALID [2022-02-20 18:13:30,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {996#true} is VALID [2022-02-20 18:13:30,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {996#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {996#true} is VALID [2022-02-20 18:13:30,673 INFO L272 TraceCheckUtils]: 2: Hoare triple {996#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {996#true} is VALID [2022-02-20 18:13:30,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,686 INFO L272 TraceCheckUtils]: 10: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,687 INFO L272 TraceCheckUtils]: 14: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,689 INFO L272 TraceCheckUtils]: 18: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,690 INFO L272 TraceCheckUtils]: 22: Hoare triple {1038#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:30,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1038#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:30,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {1038#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {1134#(= |addition_#in~n| 0)} assume true; {1134#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:30,692 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1134#(= |addition_#in~n| 0)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {1133#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {1133#(<= |addition_#in~n| 1)} assume true; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:30,693 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1133#(<= |addition_#in~n| 1)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {1128#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {1128#(<= |addition_#in~n| 2)} assume true; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:30,695 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1128#(<= |addition_#in~n| 2)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {1116#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {1116#(<= |addition_#in~n| 3)} assume true; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:30,696 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1116#(<= |addition_#in~n| 3)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {1097#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {1097#(<= |addition_#in~n| 4)} assume true; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:30,698 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1097#(<= |addition_#in~n| 4)} {1038#(= |addition_#in~n| addition_~n)} #37#return; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:30,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {1071#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:30,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {1071#(<= |addition_#in~n| 5)} assume true; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:30,699 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1071#(<= |addition_#in~n| 5)} {996#true} #35#return; {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} is VALID [2022-02-20 18:13:30,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} is VALID [2022-02-20 18:13:30,700 INFO L290 TraceCheckUtils]: 43: Hoare triple {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {997#false} is VALID [2022-02-20 18:13:30,700 INFO L290 TraceCheckUtils]: 44: Hoare triple {997#false} assume !false; {997#false} is VALID [2022-02-20 18:13:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-02-20 18:13:30,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:30,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255852307] [2022-02-20 18:13:30,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255852307] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:30,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110564699] [2022-02-20 18:13:30,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 18:13:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:30,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:30,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:30,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 18:13:30,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 18:13:30,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:30,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 18:13:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:30,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:31,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {996#true} is VALID [2022-02-20 18:13:31,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {996#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {996#true} is VALID [2022-02-20 18:13:31,069 INFO L272 TraceCheckUtils]: 2: Hoare triple {996#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {996#true} is VALID [2022-02-20 18:13:31,070 INFO L290 TraceCheckUtils]: 3: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,070 INFO L290 TraceCheckUtils]: 4: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,070 INFO L272 TraceCheckUtils]: 6: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:31,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,072 INFO L272 TraceCheckUtils]: 10: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:31,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,074 INFO L272 TraceCheckUtils]: 14: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:31,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,075 INFO L272 TraceCheckUtils]: 18: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:31,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,076 INFO L272 TraceCheckUtils]: 22: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:31,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1147#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:31,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {1147#(<= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1211#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:31,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {1211#(<= |addition_#in~n| 0)} assume true; {1211#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:31,078 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1211#(<= |addition_#in~n| 0)} {1147#(<= |addition_#in~n| addition_~n)} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:31,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {1133#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:31,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {1133#(<= |addition_#in~n| 1)} assume true; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:31,080 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1133#(<= |addition_#in~n| 1)} {1147#(<= |addition_#in~n| addition_~n)} #37#return; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:31,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {1128#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:31,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {1128#(<= |addition_#in~n| 2)} assume true; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:31,081 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1128#(<= |addition_#in~n| 2)} {1147#(<= |addition_#in~n| addition_~n)} #37#return; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:31,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {1116#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:31,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {1116#(<= |addition_#in~n| 3)} assume true; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:31,106 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1116#(<= |addition_#in~n| 3)} {1147#(<= |addition_#in~n| addition_~n)} #37#return; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:31,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {1097#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:31,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {1097#(<= |addition_#in~n| 4)} assume true; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:31,109 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1097#(<= |addition_#in~n| 4)} {1147#(<= |addition_#in~n| addition_~n)} #37#return; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:31,110 INFO L290 TraceCheckUtils]: 39: Hoare triple {1071#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:31,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {1071#(<= |addition_#in~n| 5)} assume true; {1071#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:31,111 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1071#(<= |addition_#in~n| 5)} {996#true} #35#return; {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} is VALID [2022-02-20 18:13:31,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} is VALID [2022-02-20 18:13:31,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {1037#(<= |ULTIMATE.start_main_~n~0#1| 5)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {997#false} is VALID [2022-02-20 18:13:31,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {997#false} assume !false; {997#false} is VALID [2022-02-20 18:13:31,112 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-02-20 18:13:31,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:35,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {997#false} assume !false; {997#false} is VALID [2022-02-20 18:13:35,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {1275#(< |ULTIMATE.start_main_~n~0#1| 100)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {997#false} is VALID [2022-02-20 18:13:35,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {1275#(< |ULTIMATE.start_main_~n~0#1| 100)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1275#(< |ULTIMATE.start_main_~n~0#1| 100)} is VALID [2022-02-20 18:13:35,218 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1285#(< |addition_#in~n| 100)} {996#true} #35#return; {1275#(< |ULTIMATE.start_main_~n~0#1| 100)} is VALID [2022-02-20 18:13:35,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {1285#(< |addition_#in~n| 100)} assume true; {1285#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:35,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {1285#(< |addition_#in~n| 100)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1285#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:35,220 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1097#(<= |addition_#in~n| 4)} {1295#(or (< |addition_#in~n| 100) (< 5 addition_~n))} #37#return; {1285#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:35,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {1097#(<= |addition_#in~n| 4)} assume true; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:35,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {1097#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:35,222 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1116#(<= |addition_#in~n| 3)} {1308#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} #37#return; {1097#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:35,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {1116#(<= |addition_#in~n| 3)} assume true; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:35,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {1116#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:35,223 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1128#(<= |addition_#in~n| 2)} {1321#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} #37#return; {1116#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:35,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {1128#(<= |addition_#in~n| 2)} assume true; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:35,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {1128#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:35,225 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1133#(<= |addition_#in~n| 1)} {1334#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} #37#return; {1128#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:35,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {1133#(<= |addition_#in~n| 1)} assume true; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:35,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {1133#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:35,227 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1211#(<= |addition_#in~n| 0)} {1347#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} #37#return; {1133#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:35,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {1211#(<= |addition_#in~n| 0)} assume true; {1211#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:35,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {1357#(or (<= |addition_#in~n| 0) (not (<= addition_~n 0)))} assume 0 == ~n;#res := ~m; {1211#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:35,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1357#(or (<= |addition_#in~n| 0) (not (<= addition_~n 0)))} is VALID [2022-02-20 18:13:35,229 INFO L272 TraceCheckUtils]: 22: Hoare triple {1347#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:35,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {1347#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} assume ~n > 0; {1347#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:35,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {1347#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} assume !(0 == ~n); {1347#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:35,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1347#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:35,230 INFO L272 TraceCheckUtils]: 18: Hoare triple {1334#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:35,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {1334#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} assume ~n > 0; {1334#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:35,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {1334#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} assume !(0 == ~n); {1334#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:35,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1334#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:35,232 INFO L272 TraceCheckUtils]: 14: Hoare triple {1321#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:35,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {1321#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} assume ~n > 0; {1321#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} is VALID [2022-02-20 18:13:35,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {1321#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} assume !(0 == ~n); {1321#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} is VALID [2022-02-20 18:13:35,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1321#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} is VALID [2022-02-20 18:13:35,234 INFO L272 TraceCheckUtils]: 10: Hoare triple {1308#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:35,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} assume ~n > 0; {1308#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} is VALID [2022-02-20 18:13:35,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} assume !(0 == ~n); {1308#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} is VALID [2022-02-20 18:13:35,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1308#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} is VALID [2022-02-20 18:13:35,235 INFO L272 TraceCheckUtils]: 6: Hoare triple {1295#(or (< |addition_#in~n| 100) (< 5 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {996#true} is VALID [2022-02-20 18:13:35,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {1295#(or (< |addition_#in~n| 100) (< 5 addition_~n))} assume ~n > 0; {1295#(or (< |addition_#in~n| 100) (< 5 addition_~n))} is VALID [2022-02-20 18:13:35,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {1295#(or (< |addition_#in~n| 100) (< 5 addition_~n))} assume !(0 == ~n); {1295#(or (< |addition_#in~n| 100) (< 5 addition_~n))} is VALID [2022-02-20 18:13:35,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {996#true} ~m := #in~m;~n := #in~n; {1295#(or (< |addition_#in~n| 100) (< 5 addition_~n))} is VALID [2022-02-20 18:13:35,238 INFO L272 TraceCheckUtils]: 2: Hoare triple {996#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {996#true} is VALID [2022-02-20 18:13:35,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {996#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {996#true} is VALID [2022-02-20 18:13:35,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {996#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {996#true} is VALID [2022-02-20 18:13:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:13:35,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110564699] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:35,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:35,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 20 [2022-02-20 18:13:35,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256852971] [2022-02-20 18:13:35,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:35,242 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 45 [2022-02-20 18:13:35,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:35,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-02-20 18:13:35,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:35,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 18:13:35,792 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:35,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 18:13:35,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:13:35,793 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-02-20 18:13:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:36,229 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-02-20 18:13:36,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 18:13:36,230 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) Word has length 45 [2022-02-20 18:13:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-02-20 18:13:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2022-02-20 18:13:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-02-20 18:13:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2022-02-20 18:13:36,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 63 transitions. [2022-02-20 18:13:36,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:36,294 INFO L225 Difference]: With dead ends: 52 [2022-02-20 18:13:36,294 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 18:13:36,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=251, Invalid=505, Unknown=0, NotChecked=0, Total=756 [2022-02-20 18:13:36,295 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 18:13:36,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 80 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 18:13:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 18:13:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-02-20 18:13:36,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:13:36,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:13:36,312 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:13:36,312 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:13:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:36,315 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-20 18:13:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-20 18:13:36,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:36,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:36,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) Second operand 46 states. [2022-02-20 18:13:36,316 INFO L87 Difference]: Start difference. First operand has 44 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) Second operand 46 states. [2022-02-20 18:13:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:36,319 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-20 18:13:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-20 18:13:36,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:13:36,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:13:36,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:13:36,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:13:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2022-02-20 18:13:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-02-20 18:13:36,323 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 45 [2022-02-20 18:13:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:13:36,323 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-02-20 18:13:36,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2022-02-20 18:13:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-02-20 18:13:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-20 18:13:36,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:36,325 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:36,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 18:13:36,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:36,540 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:36,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:36,540 INFO L85 PathProgramCache]: Analyzing trace with hash -489684568, now seen corresponding path program 4 times [2022-02-20 18:13:36,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:36,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449543360] [2022-02-20 18:13:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:13:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:36,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,839 INFO L272 TraceCheckUtils]: 3: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,841 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,845 INFO L272 TraceCheckUtils]: 3: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,846 INFO L272 TraceCheckUtils]: 7: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,849 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,851 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,852 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,854 INFO L272 TraceCheckUtils]: 3: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,856 INFO L272 TraceCheckUtils]: 7: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,857 INFO L272 TraceCheckUtils]: 11: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,859 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,861 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,863 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {1850#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {1850#(<= |addition_#in~n| 3)} assume true; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,865 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1850#(<= |addition_#in~n| 3)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,867 INFO L272 TraceCheckUtils]: 3: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,868 INFO L272 TraceCheckUtils]: 7: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,870 INFO L272 TraceCheckUtils]: 11: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,871 INFO L272 TraceCheckUtils]: 15: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,873 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,875 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,877 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {1850#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {1850#(<= |addition_#in~n| 3)} assume true; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,879 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1850#(<= |addition_#in~n| 3)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {1831#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {1831#(<= |addition_#in~n| 4)} assume true; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,881 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1831#(<= |addition_#in~n| 4)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,882 INFO L272 TraceCheckUtils]: 3: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,884 INFO L272 TraceCheckUtils]: 7: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,885 INFO L272 TraceCheckUtils]: 11: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,887 INFO L272 TraceCheckUtils]: 15: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,888 INFO L272 TraceCheckUtils]: 19: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,891 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,893 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,895 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {1850#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {1850#(<= |addition_#in~n| 3)} assume true; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,897 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1850#(<= |addition_#in~n| 3)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {1831#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {1831#(<= |addition_#in~n| 4)} assume true; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,898 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1831#(<= |addition_#in~n| 4)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {1805#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {1805#(<= |addition_#in~n| 5)} assume true; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,900 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1805#(<= |addition_#in~n| 5)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,902 INFO L272 TraceCheckUtils]: 3: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,903 INFO L272 TraceCheckUtils]: 7: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,904 INFO L272 TraceCheckUtils]: 11: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,905 INFO L272 TraceCheckUtils]: 15: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,907 INFO L272 TraceCheckUtils]: 19: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,908 INFO L272 TraceCheckUtils]: 23: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,910 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,912 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,913 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {1850#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {1850#(<= |addition_#in~n| 3)} assume true; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,915 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1850#(<= |addition_#in~n| 3)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {1831#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {1831#(<= |addition_#in~n| 4)} assume true; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,917 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1831#(<= |addition_#in~n| 4)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {1805#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {1805#(<= |addition_#in~n| 5)} assume true; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,918 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1805#(<= |addition_#in~n| 5)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {1772#(<= |addition_#in~n| 6)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {1772#(<= |addition_#in~n| 6)} assume true; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,920 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1772#(<= |addition_#in~n| 6)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:36,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,922 INFO L272 TraceCheckUtils]: 3: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,923 INFO L272 TraceCheckUtils]: 7: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,925 INFO L272 TraceCheckUtils]: 15: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,927 INFO L272 TraceCheckUtils]: 19: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,928 INFO L272 TraceCheckUtils]: 23: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,929 INFO L272 TraceCheckUtils]: 27: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,929 INFO L290 TraceCheckUtils]: 28: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,931 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,931 INFO L290 TraceCheckUtils]: 32: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,933 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,933 INFO L290 TraceCheckUtils]: 35: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,933 INFO L290 TraceCheckUtils]: 36: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,934 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {1850#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,935 INFO L290 TraceCheckUtils]: 39: Hoare triple {1850#(<= |addition_#in~n| 3)} assume true; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,936 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1850#(<= |addition_#in~n| 3)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {1831#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {1831#(<= |addition_#in~n| 4)} assume true; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,938 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1831#(<= |addition_#in~n| 4)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,938 INFO L290 TraceCheckUtils]: 44: Hoare triple {1805#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,938 INFO L290 TraceCheckUtils]: 45: Hoare triple {1805#(<= |addition_#in~n| 5)} assume true; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,939 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1805#(<= |addition_#in~n| 5)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {1772#(<= |addition_#in~n| 6)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {1772#(<= |addition_#in~n| 6)} assume true; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,941 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1772#(<= |addition_#in~n| 6)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:36,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {1732#(<= |addition_#in~n| 7)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:36,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {1732#(<= |addition_#in~n| 7)} assume true; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:36,942 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1732#(<= |addition_#in~n| 7)} {1629#true} #35#return; {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 18:13:36,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1629#true} is VALID [2022-02-20 18:13:36,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1629#true} is VALID [2022-02-20 18:13:36,943 INFO L272 TraceCheckUtils]: 2: Hoare triple {1629#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {1629#true} is VALID [2022-02-20 18:13:36,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,944 INFO L272 TraceCheckUtils]: 6: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,945 INFO L272 TraceCheckUtils]: 10: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,946 INFO L272 TraceCheckUtils]: 14: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,948 INFO L272 TraceCheckUtils]: 18: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,949 INFO L272 TraceCheckUtils]: 22: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,950 INFO L272 TraceCheckUtils]: 26: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume ~n > 0; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,951 INFO L272 TraceCheckUtils]: 30: Hoare triple {1685#(= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:36,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1685#(= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:36,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {1685#(= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {1868#(= |addition_#in~n| 0)} assume true; {1868#(= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:36,953 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1868#(= |addition_#in~n| 0)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:36,955 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:36,956 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {1850#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {1850#(<= |addition_#in~n| 3)} assume true; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:36,958 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1850#(<= |addition_#in~n| 3)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {1831#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {1831#(<= |addition_#in~n| 4)} assume true; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:36,960 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1831#(<= |addition_#in~n| 4)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {1805#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {1805#(<= |addition_#in~n| 5)} assume true; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:36,961 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1805#(<= |addition_#in~n| 5)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,962 INFO L290 TraceCheckUtils]: 50: Hoare triple {1772#(<= |addition_#in~n| 6)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,962 INFO L290 TraceCheckUtils]: 51: Hoare triple {1772#(<= |addition_#in~n| 6)} assume true; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:36,963 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1772#(<= |addition_#in~n| 6)} {1685#(= |addition_#in~n| addition_~n)} #37#return; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:36,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {1732#(<= |addition_#in~n| 7)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:36,964 INFO L290 TraceCheckUtils]: 54: Hoare triple {1732#(<= |addition_#in~n| 7)} assume true; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:36,964 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {1732#(<= |addition_#in~n| 7)} {1629#true} #35#return; {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 18:13:36,965 INFO L290 TraceCheckUtils]: 56: Hoare triple {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 18:13:36,965 INFO L290 TraceCheckUtils]: 57: Hoare triple {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {1630#false} is VALID [2022-02-20 18:13:36,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {1630#false} assume !false; {1630#false} is VALID [2022-02-20 18:13:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-02-20 18:13:36,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:36,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449543360] [2022-02-20 18:13:36,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449543360] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:13:36,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860037933] [2022-02-20 18:13:36,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 18:13:36,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:13:36,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:36,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:13:36,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 18:13:37,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 18:13:37,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:13:37,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 18:13:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:37,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:13:37,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1629#true} is VALID [2022-02-20 18:13:37,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1629#true} is VALID [2022-02-20 18:13:37,455 INFO L272 TraceCheckUtils]: 2: Hoare triple {1629#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {1629#true} is VALID [2022-02-20 18:13:37,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,456 INFO L272 TraceCheckUtils]: 6: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:37,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,457 INFO L272 TraceCheckUtils]: 10: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:37,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,458 INFO L272 TraceCheckUtils]: 14: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:37,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,459 INFO L272 TraceCheckUtils]: 18: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:37,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,468 INFO L272 TraceCheckUtils]: 22: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:37,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,469 INFO L272 TraceCheckUtils]: 26: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:37,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume !(0 == ~n); {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume ~n > 0; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,470 INFO L272 TraceCheckUtils]: 30: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:37,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {1881#(<= |addition_#in~n| addition_~n)} is VALID [2022-02-20 18:13:37,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {1881#(<= |addition_#in~n| addition_~n)} assume 0 == ~n;#res := ~m; {1969#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:37,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {1969#(<= |addition_#in~n| 0)} assume true; {1969#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:37,473 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1969#(<= |addition_#in~n| 0)} {1881#(<= |addition_#in~n| addition_~n)} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:37,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:37,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:37,475 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {1881#(<= |addition_#in~n| addition_~n)} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:37,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:37,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:37,478 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {1881#(<= |addition_#in~n| addition_~n)} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:37,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {1850#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:37,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {1850#(<= |addition_#in~n| 3)} assume true; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:37,480 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1850#(<= |addition_#in~n| 3)} {1881#(<= |addition_#in~n| addition_~n)} #37#return; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:37,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {1831#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:37,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {1831#(<= |addition_#in~n| 4)} assume true; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:37,482 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1831#(<= |addition_#in~n| 4)} {1881#(<= |addition_#in~n| addition_~n)} #37#return; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:37,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {1805#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:37,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {1805#(<= |addition_#in~n| 5)} assume true; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:37,484 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1805#(<= |addition_#in~n| 5)} {1881#(<= |addition_#in~n| addition_~n)} #37#return; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:37,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {1772#(<= |addition_#in~n| 6)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:37,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {1772#(<= |addition_#in~n| 6)} assume true; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:37,486 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1772#(<= |addition_#in~n| 6)} {1881#(<= |addition_#in~n| addition_~n)} #37#return; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:37,487 INFO L290 TraceCheckUtils]: 53: Hoare triple {1732#(<= |addition_#in~n| 7)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:37,488 INFO L290 TraceCheckUtils]: 54: Hoare triple {1732#(<= |addition_#in~n| 7)} assume true; {1732#(<= |addition_#in~n| 7)} is VALID [2022-02-20 18:13:37,489 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {1732#(<= |addition_#in~n| 7)} {1629#true} #35#return; {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 18:13:37,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} is VALID [2022-02-20 18:13:37,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {1684#(<= |ULTIMATE.start_main_~n~0#1| 7)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {1630#false} is VALID [2022-02-20 18:13:37,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {1630#false} assume !false; {1630#false} is VALID [2022-02-20 18:13:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-02-20 18:13:37,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:13:45,449 INFO L290 TraceCheckUtils]: 58: Hoare triple {1630#false} assume !false; {1630#false} is VALID [2022-02-20 18:13:45,449 INFO L290 TraceCheckUtils]: 57: Hoare triple {2051#(< |ULTIMATE.start_main_~n~0#1| 100)} assume !((main_~m~0#1 < 100 || main_~n~0#1 < 100) || main_~result~0#1 >= 200); {1630#false} is VALID [2022-02-20 18:13:45,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {2051#(< |ULTIMATE.start_main_~n~0#1| 100)} assume -9223372036854775808 <= main_#t~ret8#1 && main_#t~ret8#1 <= 9223372036854775807;main_~result~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {2051#(< |ULTIMATE.start_main_~n~0#1| 100)} is VALID [2022-02-20 18:13:45,450 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2061#(< |addition_#in~n| 100)} {1629#true} #35#return; {2051#(< |ULTIMATE.start_main_~n~0#1| 100)} is VALID [2022-02-20 18:13:45,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {2061#(< |addition_#in~n| 100)} assume true; {2061#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:45,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {2061#(< |addition_#in~n| 100)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {2061#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:45,452 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1772#(<= |addition_#in~n| 6)} {2071#(or (< |addition_#in~n| 100) (< 7 addition_~n))} #37#return; {2061#(< |addition_#in~n| 100)} is VALID [2022-02-20 18:13:45,452 INFO L290 TraceCheckUtils]: 51: Hoare triple {1772#(<= |addition_#in~n| 6)} assume true; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:45,452 INFO L290 TraceCheckUtils]: 50: Hoare triple {1772#(<= |addition_#in~n| 6)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:45,453 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {1805#(<= |addition_#in~n| 5)} {2084#(or (<= |addition_#in~n| 6) (< 6 addition_~n))} #37#return; {1772#(<= |addition_#in~n| 6)} is VALID [2022-02-20 18:13:45,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {1805#(<= |addition_#in~n| 5)} assume true; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:45,454 INFO L290 TraceCheckUtils]: 47: Hoare triple {1805#(<= |addition_#in~n| 5)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:45,459 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1831#(<= |addition_#in~n| 4)} {2097#(or (< 5 addition_~n) (<= |addition_#in~n| 5))} #37#return; {1805#(<= |addition_#in~n| 5)} is VALID [2022-02-20 18:13:45,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {1831#(<= |addition_#in~n| 4)} assume true; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:45,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {1831#(<= |addition_#in~n| 4)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:45,461 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1850#(<= |addition_#in~n| 3)} {2110#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} #37#return; {1831#(<= |addition_#in~n| 4)} is VALID [2022-02-20 18:13:45,462 INFO L290 TraceCheckUtils]: 42: Hoare triple {1850#(<= |addition_#in~n| 3)} assume true; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:45,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {1850#(<= |addition_#in~n| 3)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:45,463 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1862#(<= |addition_#in~n| 2)} {2123#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} #37#return; {1850#(<= |addition_#in~n| 3)} is VALID [2022-02-20 18:13:45,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {1862#(<= |addition_#in~n| 2)} assume true; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:45,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {1862#(<= |addition_#in~n| 2)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:45,464 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1867#(<= |addition_#in~n| 1)} {2136#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} #37#return; {1862#(<= |addition_#in~n| 2)} is VALID [2022-02-20 18:13:45,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {1867#(<= |addition_#in~n| 1)} assume true; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:45,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {1867#(<= |addition_#in~n| 1)} assume -9223372036854775808 <= #t~ret4 && #t~ret4 <= 9223372036854775807;#res := #t~ret4;havoc #t~ret4; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:45,468 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1969#(<= |addition_#in~n| 0)} {2149#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} #37#return; {1867#(<= |addition_#in~n| 1)} is VALID [2022-02-20 18:13:45,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {1969#(<= |addition_#in~n| 0)} assume true; {1969#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:45,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {2159#(or (<= |addition_#in~n| 0) (not (<= addition_~n 0)))} assume 0 == ~n;#res := ~m; {1969#(<= |addition_#in~n| 0)} is VALID [2022-02-20 18:13:45,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {2159#(or (<= |addition_#in~n| 0) (not (<= addition_~n 0)))} is VALID [2022-02-20 18:13:45,470 INFO L272 TraceCheckUtils]: 30: Hoare triple {2149#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:45,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {2149#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} assume ~n > 0; {2149#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:45,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {2149#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} assume !(0 == ~n); {2149#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:45,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {2149#(or (<= |addition_#in~n| 1) (< 1 addition_~n))} is VALID [2022-02-20 18:13:45,472 INFO L272 TraceCheckUtils]: 26: Hoare triple {2136#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:45,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {2136#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} assume ~n > 0; {2136#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:45,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {2136#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} assume !(0 == ~n); {2136#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:45,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {2136#(or (< 2 addition_~n) (<= |addition_#in~n| 2))} is VALID [2022-02-20 18:13:45,474 INFO L272 TraceCheckUtils]: 22: Hoare triple {2123#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:45,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {2123#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} assume ~n > 0; {2123#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} is VALID [2022-02-20 18:13:45,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {2123#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} assume !(0 == ~n); {2123#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} is VALID [2022-02-20 18:13:45,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {2123#(or (<= |addition_#in~n| 3) (< 3 addition_~n))} is VALID [2022-02-20 18:13:45,476 INFO L272 TraceCheckUtils]: 18: Hoare triple {2110#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:45,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {2110#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} assume ~n > 0; {2110#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} is VALID [2022-02-20 18:13:45,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {2110#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} assume !(0 == ~n); {2110#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} is VALID [2022-02-20 18:13:45,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {2110#(or (< 4 addition_~n) (<= |addition_#in~n| 4))} is VALID [2022-02-20 18:13:45,477 INFO L272 TraceCheckUtils]: 14: Hoare triple {2097#(or (< 5 addition_~n) (<= |addition_#in~n| 5))} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:45,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {2097#(or (< 5 addition_~n) (<= |addition_#in~n| 5))} assume ~n > 0; {2097#(or (< 5 addition_~n) (<= |addition_#in~n| 5))} is VALID [2022-02-20 18:13:45,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {2097#(or (< 5 addition_~n) (<= |addition_#in~n| 5))} assume !(0 == ~n); {2097#(or (< 5 addition_~n) (<= |addition_#in~n| 5))} is VALID [2022-02-20 18:13:45,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {2097#(or (< 5 addition_~n) (<= |addition_#in~n| 5))} is VALID [2022-02-20 18:13:45,478 INFO L272 TraceCheckUtils]: 10: Hoare triple {2084#(or (<= |addition_#in~n| 6) (< 6 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:45,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {2084#(or (<= |addition_#in~n| 6) (< 6 addition_~n))} assume ~n > 0; {2084#(or (<= |addition_#in~n| 6) (< 6 addition_~n))} is VALID [2022-02-20 18:13:45,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {2084#(or (<= |addition_#in~n| 6) (< 6 addition_~n))} assume !(0 == ~n); {2084#(or (<= |addition_#in~n| 6) (< 6 addition_~n))} is VALID [2022-02-20 18:13:45,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {2084#(or (<= |addition_#in~n| 6) (< 6 addition_~n))} is VALID [2022-02-20 18:13:45,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {2071#(or (< |addition_#in~n| 100) (< 7 addition_~n))} call #t~ret4 := addition(1 + ~m, ~n - 1); {1629#true} is VALID [2022-02-20 18:13:45,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {2071#(or (< |addition_#in~n| 100) (< 7 addition_~n))} assume ~n > 0; {2071#(or (< |addition_#in~n| 100) (< 7 addition_~n))} is VALID [2022-02-20 18:13:45,481 INFO L290 TraceCheckUtils]: 4: Hoare triple {2071#(or (< |addition_#in~n| 100) (< 7 addition_~n))} assume !(0 == ~n); {2071#(or (< |addition_#in~n| 100) (< 7 addition_~n))} is VALID [2022-02-20 18:13:45,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {1629#true} ~m := #in~m;~n := #in~n; {2071#(or (< |addition_#in~n| 100) (< 7 addition_~n))} is VALID [2022-02-20 18:13:45,481 INFO L272 TraceCheckUtils]: 2: Hoare triple {1629#true} call main_#t~ret8#1 := addition(main_~m~0#1, main_~n~0#1); {1629#true} is VALID [2022-02-20 18:13:45,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1629#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_~m~0#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1629#true} is VALID [2022-02-20 18:13:45,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {1629#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1629#true} is VALID [2022-02-20 18:13:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 18:13:45,482 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860037933] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:13:45,483 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:13:45,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 24 [2022-02-20 18:13:45,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476472331] [2022-02-20 18:13:45,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:13:45,484 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 10 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 59